20 citations · 27 across the 9 of their papers we have counts for
3 papers · 1 filter
Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling
Camille Grange, Marion Lavignac, Valentina Pozzoli +1
Quantum Approximate Optimization Algorithm (QAOA) is one of the most short-term promising quantum-classical algorithm to solve unconstrained combinatorial optimization problems. It…
Moderate Exponential-time Quantum Dynamic Programming Across the Subsets for Scheduling Problems
Camille Grange, Michael Poss, Eric Bourreau +2
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 optimiza…
Indirect Job-Shop coding using rank: application to QAOA (IQAOA)
Eric Bourreau, Gerard Fleury, Phlippe Lacomme
The Job-Shop Scheduling Problem (JSSP) stands as one of the most renowned challenges in scheduling. It is characterized as a disjunctive problem, wherein a solution is fully depict…