Unconstrained binary models of the travelling salesman problem variants for quantum optimization
From MaRDI portal
Publication:2102287
DOI10.1007/S11128-021-03405-5OpenAlexW3168231284MaRDI QIDQ2102287FDOQ2102287
Authors: Özlem Salehi, Adam Glos, 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
Recommendations
- scientific article; zbMATH DE number 7496272
- Optimal Seating Assignment in the COVID-19 Era via Quantum Computing
- Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing
- Adapting the traveling salesman problem to an adiabatic quantum computer
- Lower bounds on circuit depth of the quantum approximate optimization algorithm
Cites Work
- The traveling salesman problem. A computational study.
- Optimization by simulated annealing
- Title not available (Why is that?)
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- The traveling salesman problem and its variations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimization using quantum mechanics: quantum annealing through adiabatic evolution
- The unconstrained binary quadratic programming problem: a survey
- A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
- State-space relaxation procedures for the computation of bounds to routing problems
- Quantum stochastic optimization
- 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
- Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
- Title not available (Why is that?)
- A hybrid exact algorithm for the TSPTW
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- Theory versus practice in annealing-based quantum computing
- New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times
Cited In (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
This page was built for publication: Unconstrained binary models of the travelling salesman problem variants for quantum optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102287)
