2 citations · 4 across the 6 of their papers we have counts for
3 papers · 1 filter
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…
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…
Steiner Traveling Salesman Problem with Quantum Annealing
Alessia Ciacco, Francesca Guerriero, Eneko Osaba
The Steiner Traveling Salesman Problem (STSP) is a variant of the classical Traveling Salesman Problem. The STSP involves incorporating steiner nodes, which are extra nodes not ori…