3 papers
cs.NE2026
Linear Ordering Problem: Time for a Change
Fabrizio Fagiolo, Marco Baioletti, Valentino Santucci
The Linear Ordering Problem (LOP) is a fundamental combinatorial optimization problem with important applications in areas such as economics, social choice, and machine learning. I…
quant-ph2025
Divide-et-impera Heuristic-based Randomized Search for the Qubit Routing Problem
Marco Baioletti, Fabrizio Fagiolo, Angelo Oddi +1
This paper introduces the DIRSH algorithm for the Qubit Routing Problem (QRP), using a heuristic-guided randomized divide-and-conquer strategy. The method splits the circuit into c…
cs.AI2025
Freeze and Conquer: Reusable Ansatz for Solving the Traveling Salesman Problem
Fabrizio Fagiolo, Nicolò Vescera
In this paper we present a variational algorithm for the Traveling Salesman Problem (TSP) that combines (i) a compact encoding of permutations, which reduces the qubit requirement…