Sökning: "Combinatorial Optimization"

Visar resultat 1 - 5 av 81 avhandlingar innehållade orden Combinatorial Optimization.

  1. 1. Combinatorial Optimization : Three Applications

    Författare :Efraim Laksman; Blekinge Tekniska Högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : Combinatorial optimization is a diverse area of mathematics. It concerns optimization on feasible regions defined by discrete sets, graphs, hypergraphs, matroids, etc. . . LÄS MER

  3. 2. On Some Combinatorial Optimization Problems : Algorithms and Complexity

    Författare :Hannes Uppman; Peter Jonsson; Christer Bäckström; Ulf Nilsson; Stanislav Živný; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computational complexity; optimization; constraint satisfaction problem;

    Sammanfattning : This thesis is about the computational complexity of several classes of combinatorial optimization problems, all related to the constraint satisfaction problems.A constraint language consists of a domain and a set of relations on the domain. For each such language there is a constraint satisfaction problem (CSP). LÄS MER

  4. 3. Application of the quantum approximate optimization algorithm to combinatorial optimization problems

    Författare :Pontus Vikstål; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; combinatorial optimization; quantum computing; Quantum approximate optimization algorithm;

    Sammanfattning : This licentiate thesis is an extended introduction to the accompanying papers, which encompass a study of the quantum approximate optimization algorithm (QAOA). It is a hybrid quantum-classical algorithm for solving combinatorial optimization problems and is a promising algorithm to run on near term quantum devices. LÄS MER

  5. 4. Online Combinatorial Optimization under Bandit Feedback

    Författare :Mohammad Sadegh Talebi Mazraeh Shahi; Alexandre Proutiere; Vianney Perchet; KTH; []
    Nyckelord :Combinatorial Optimization; Online Learning; Multi-armed Bandits; Sequential Decision Making; Matematik; Mathematics; Datalogi; Computer Science;

    Sammanfattning : Multi-Armed Bandits (MAB) constitute the most fundamental model for sequential decision making problems with an exploration vs. exploitation trade-off. In such problems, the decision maker selects an arm in each round and observes a realization of the corresponding unknown reward distribution. LÄS MER

  7. 5. Combinatorial Optimization for Infinite Games on Graphs

    Författare :Henrik Björklund; Sergei Vorobyov; Erich Grädel; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; infinite games; combinatorial optimization; randomized algorithms; model checking; strategy evaluation functions; linear programming; iterative improvement; local search; Computer science; Datavetenskap;

    Sammanfattning : Games on graphs have become an indispensable tool in modern computer science. They provide powerful and expressive models for numerous phenomena and are extensively used in computer- aided verification, automata theory, logic, complexity theory, computational biology, etc. LÄS MER