Unconstrained binary models of the travelling salesman problem variants for quantum optimization
From MaRDI portal
(Redirected from Publication:2102287)
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
- A hybrid exact algorithm for the TSPTW
- A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
- An exact constraint logic programming algorithm for the traveling salesman problem with time windows
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- scientific article; zbMATH DE number 5899272 (Why is no real title available?)
- scientific article; zbMATH DE number 3473554 (Why is no real title available?)
- scientific article; zbMATH DE number 870411 (Why is no real title available?)
- scientific article; zbMATH DE number 956787 (Why is no real title available?)
- New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times
- New state-space relaxations for solving the traveling salesman problem with time windows
- Optimization by simulated annealing
- Optimization using quantum mechanics: quantum annealing through adiabatic evolution
- Quantum stochastic optimization
- State-space relaxation procedures for the computation of bounds to routing problems
- Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
- The traveling salesman problem and its variations
- The traveling salesman problem. A computational study.
- The unconstrained binary quadratic programming problem: a survey
- Theory versus practice in annealing-based quantum computing
Cited in
(11)- Statistical quality assessment of Ising-based annealer outputs
- Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing
- Analyzing the quantum annealing approach for solving linear least squares problems
- Quantum approximate optimization for combinatorial problems with constraints
- Quantum annealing to solve the unrelated parallel machine scheduling problem
- Solving the traveling salesman problem with a hybrid quantum-classical feedforward neural network
- Solving the Kemeny ranking aggregation problem with quantum optimization algorithms
- High-speed train timetable optimization based on space-time network model and quantum simulator
- On post-processing the results of quantum optimizers
- Quantum computing for discrete optimization: a highlight of three technologies
- Review of the application of quantum annealing-related technologies in transportation optimization
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)
