2 papers
cs.CC2026
Separating comb inequalities is NP-hard
Yohan Finet, Victor Drouin-Touchette
Comb inequalities are important cutting planes for the symmetric travelling salesman problem, yet the complexity of their exact separation has remained a longstanding question in p…
quant-ph2026
Quantum-enhanced Monte Carlo Tree Search framework for combinatorial optimization problems
Yohan Finet, Yves Bérubé-Lauzière, Victor Drouin-Touchette
Over the past decades, the operations research community has developed numerous effective optimization algorithms, yet quantum computing is emerging as a new computational paradigm…