Unconstrained binary models of the travelling salesman problem variants for quantum optimization
From MaRDI portal
Publication:2102287
DOI10.1007/s11128-021-03405-5OpenAlexW3168231284MaRDI QIDQ2102287
Adam Glos, Özlem Salehi, Jarosław Adam Miszczak
Publication date: 28 November 2022
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.09056
Related Items (4)
Solving the traveling salesman problem with a hybrid quantum-classical feedforward neural network ⋮ Solving the Kemeny ranking aggregation problem with quantum optimization algorithms ⋮ Statistical quality assessment of Ising-based annealer outputs ⋮ Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- The unconstrained binary quadratic programming problem: a survey
- The traveling salesman problem and its variations
- Quantum stochastic optimization
- Theory versus practice in annealing-based quantum computing
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
- New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows
- A Hybrid Exact Algorithm for the TSPTW
- A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
- Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
- State-space relaxation procedures for the computation of bounds to routing problems
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- Optimization using quantum mechanics: quantum annealing through adiabatic evolution
- New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times
This page was built for publication: Unconstrained binary models of the travelling salesman problem variants for quantum optimization
