1 citations · 2 across the 5 of their papers we have counts for
6 papers
School network reorganization under educational and spatial constraints using classical and quantum optimization
Alessia Ciacco, Luigi Di Puglia Pugliese, Francesca Guerriero
School network reorganization is a strategic planning problem that requires balancing demographic trends, territorial accessibility, educational requirements, and institutional con…
Steiner Traveling Salesman Problem with Time Windows and Pickup-Delivery: integrating classical and quantum optimization
Alessia Ciacco, Francesca Guerriero, Eneko Osaba
We propose the Steiner Traveling Salesman Problem with Time Windows and Pickup and Delivery, an advanced and practical extension of classical routing models. This variant integrate…
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…
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…
Quantum Annealing for Staff Scheduling in Educational Environments
Alessia Ciacco, Francesca Guerriero, Eneko Osaba
We address a novel staff allocation problem that arises in the organization of collaborators among multiple school sites and educational levels. The problem emerges from a real cas…
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…