Comparing Quantum Annealer and Metaheuristic Methods to Solve the Steiner Tree Problem
- 16 November 2025
- book chapter
- Published by Springer Nature
- p. 91-106
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Mapping a logical representation of TSP to quantum annealingQuantum Information Processing, 2021
- QUBO formulations of the longest path problemTheoretical Computer Science, 2021
- Solving Steiner trees: Recent advances, challenges, and perspectivesNetworks, 2020
- Quantum Speedup for the Minimum Steiner Tree Problem2020
- New Hybrid Quantum Annealing Algorithms for Solving Vehicle Routing Problem2020
- Digital Annealer for High-Speed Solving of Combinatorial optimization Problems and Its Applications2020
- Solving the Bounded-Depth Steiner Tree Problem using an Adiabatic Quantum Computer2019
- Quantum Annealing of Vehicle Routing Problem with Time, State and Capacity2019
- Polyhedral Approaches for the Steiner Tree Problem on Graphs2001
- A catalog of steiner tree formulationsNetworks, 1993