Zobrazeno 1 - 10
of 536
pro vyhledávání: '"Poss, Michael"'
Grover Search is currently one of the main quantum algorithms leading to hybrid quantum-classical methods that reduce the worst-case time complexity for some combinatorial optimization problems. Specifically, the combination of Quantum Minimum Findin
Externí odkaz:
http://arxiv.org/abs/2408.05741
Publikováno v:
4OR, 2023, Volume 21, Pages 363-403
Noisy intermediate-scale quantum computers (NISQ computers) are now readily available, motivating many researchers to experiment with Variational Quantum Algorithms (VQAs). Among them, the Quantum Approximate Optimization Algorithm (QAOA) is one of t
Externí odkaz:
http://arxiv.org/abs/2212.11734
Many combinatorial optimization problems can be formulated as the search for a subgraph that satisfies certain properties and minimizes the total weight. We assume here that the vertices correspond to points in a metric space and can take any positio
Externí odkaz:
http://arxiv.org/abs/2206.08187
Many discrete optimization problems amount to selecting a feasible set of edges of least weight. We consider in this paper the context of spatial graphs where the positions of the vertices are uncertain and belong to known uncertainty sets. The objec
Externí odkaz:
http://arxiv.org/abs/2109.00389
We consider robust combinatorial optimization problems with cost uncertainty where the decision maker can prepare K solutions beforehand and chooses the best of them once the true cost is revealed. Also known as min-max-min robustness (a special case
Externí odkaz:
http://arxiv.org/abs/1910.12608
Publikováno v:
In Computers and Operations Research December 2023 160
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Chaudhuri, Dipankar, Lu, Tiangong, Jacob, Binu, Abraham, Sojan, Shankar, Premlata, Poss, Michael A., Neamati, Nouri, Camarero, Julio A.
Publikováno v:
In Journal of Controlled Release July 2023 359:26-32
We study approximation algorithms for the problem of minimizing the makespan on a set of machines with uncertainty on the processing times of jobs. In the model we consider, which goes back to~\cite{BertsimasS03}, once the schedule is defined an adve
Externí odkaz:
http://arxiv.org/abs/1905.08592