Showing quant-phShow all
2 papers · 1 filter
quant-ph2026
Traveling Salesman Problem with a preprocessing method for classical and quantum optimization
Alessia Ciacco, Luigi Di Puglia Pugliese, Francesca Guerriero
The Traveling Salesman Problem is a fundamental combinatorial optimization problem widely studied in operations research. Despite its simple formulation, it remains computationally…
quant-ph2026
Cutting-plane methodology via quantum optimization for solving the Traveling Salesman Problem
Alessia Ciacco, Luigi Di Puglia Pugliese, Francesca Guerriero
The Traveling Salesman Problem is a classical NP-hard combinatorial optimization problem that has been extensively studied in operations research. A major challenge in Traveling Sa…