Camille Grange

Camille Grange

Auto-generated profile, based on publicly available information

Camille Grange

LIRMM, University of Montpellier, CNRS, Montpellier, France

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications

13 September 2024 in Annals of Operations Research
Verified
Journal Article
Closed access
PDF file
CGCamille Grange
Camille Grange
MPMichael Poss
Michael Poss
EBEric Bourreau
Eric Bourreau

6 September 2024 in European Journal of Operational Research
Verified
Journal Article
Closed access
CGCamille Grange
Camille Grange
MPMichael Poss
Michael Poss
EBEric Bourreau
Eric Bourreau
VTVincent T’kIndt
Vincent T’kIndt
OPOlivier Ploton
Olivier Ploton

15 July 2023
Verified
Conference Paper
Open access
CGCamille Grange
Camille Grange
EBEric Bourreau
Eric Bourreau
MPMichael Poss
Michael Poss
VTVincent T'KIndt
Vincent T'KIndt
Grover search is currently one of the main approaches to obtain quantum speed-ups for combinatorial optimization problems. The combination of Quantum Minimum Finding (obtained from Grover search) with dynamic programming has proved particularly efficient to improve the worst-case complexity of several NP-hard optimization problems. Specifically, for these problems, the classical dynamic programming complexity (ignoring the polynomial factors) in O* (cn) can be reduced by a bounded-error hybrid quantum-classical algorithm to O* (cnquant) for cquant < c. In this paper, we extend the resulting hybrid dynamic programming algorithm to three examples of single-machine scheduling problems: minimizing the total weighted completion time with deadlines, minimizing the total weighted completion time with precedence constraints, and minimizing the total weighted tardiness. The extension relies on the inclusion of a pseudo-polynomial term in the state space of the dynamic programming as well as an additive term in the recurrence.