20 citations · 21 across the 4 of their papers we have counts for
5 papers
An introduction to variational quantum algorithms for combinatorial optimization problems
Camille Grange, Michael Poss, Eric Bourreau
Noisy intermediate-scale quantum computers (NISQ computers) are now readily available, motivating many researchers to experiment with Variational Quantum Algorithms (VQAs). Among t…
Approximating optimization problems in graphs with locational uncertainty
Marin Bougeret, Jérémy Omer, Michael Poss
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 ve…
Optimization problems in graphs with locational uncertainty
Marin Bougeret, Jérémy Omer, Michael Poss
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…
Min-Max-Min Robustness for Combinatorial Problems with Discrete Budgeted Uncertainty
Marc Goerigk, Jannis Kurtz, Michael Poss
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…
Approximation results for makespan minimization with budgeted uncertainty
Marin Bougeret, Klaus Jansen, Michael Poss +1
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…