On the public citation graph

Quantum Algorithms for Solving the Traveling Salesman Problem

0 signed · 74 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/0-306-48213-4_1openalex-snapshot
The Traveling Salesman Problem: Applications, Formulations and Variations
inferredcites →https://doi.org/10.1007/3-540-36478-1_17openalex-snapshot
Exact Algorithms for NP-Hard Problems: A Survey
inferredcites →https://doi.org/10.1007/978-3-540-45078-8_27openalex-snapshot
The Traveling Salesman Problem for Cubic Graphs
inferredcites →https://doi.org/10.1007/978-3-540-70575-8_17openalex-snapshot
The Travelling Salesman Problem in Bounded Degree Graphs
inferredcites →https://doi.org/10.1007/978-3-642-32241-9_7openalex-snapshot
An Improved Exact Algorithm for TSP in Degree-4 Graphs
inferredcites →https://doi.org/10.1007/978-3-642-38236-9_10openalex-snapshot
An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity Structure
inferredcites →https://doi.org/10.1007/978-3-642-39206-1_17openalex-snapshot
Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth
inferredcites →https://doi.org/10.1007/s00291-022-00680-1openalex-snapshot
The traveling salesman problem with drone resupply
inferredcites →https://doi.org/10.1007/s00521-022-07438-4openalex-snapshot
An investigation of IBM quantum computing device performance on combinatorial optimisation problems
inferredcites →https://doi.org/10.1007/s10479-022-04695-3openalex-snapshot
Quantum Bridge Analytics II: QUBO-Plus, network optimization and combinatorial chaining for asset exchange
inferredcites →https://doi.org/10.1007/s11128-008-0082-9openalex-snapshot
Minor-embedding in adiabatic quantum computation: I. The parameter setting problem
inferredcites →https://doi.org/10.1007/s11128-021-03321-8openalex-snapshot
Mapping a logical representation of TSP to quantum annealing
inferredcites →https://doi.org/10.1007/s11128-021-03405-5openalex-snapshot
Unconstrained binary models of the travelling salesman problem variants for quantum optimization
inferredcites →https://doi.org/10.1007/s42452-019-1829-xopenalex-snapshot
Solving the traveling salesman problem on a quantum annealer
inferredcites →https://doi.org/10.1016/0377-2217(92)90138-yopenalex-snapshot
The traveling salesman problem: An overview of exact and approximate algorithms
inferredcites →https://doi.org/10.1016/j.dam.2012.08.025openalex-snapshot
A hybrid algorithm for the DNA sequencing problem
inferredcites →https://doi.org/10.1016/j.ejor.2017.08.025openalex-snapshot
Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems
inferredcites →https://doi.org/10.1016/j.ejor.2023.07.022openalex-snapshot
A comprehensive survey on the generalized traveling salesman problem
inferredcites →https://doi.org/10.1016/j.ejor.2024.04.014openalex-snapshot
A survey on the Traveling Salesman Problem and its variants in a warehousing context
inferredcites →https://doi.org/10.1016/j.ic.2014.12.008openalex-snapshot
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
inferredcites →https://doi.org/10.1016/j.physrep.2012.10.002openalex-snapshot
The quantum adiabatic algorithm applied to random optimization problems: The quantum spin glass perspective
inferredcites →https://doi.org/10.1016/j.tcs.2023.114369openalex-snapshot
Minor embedding in broken chimera and derived graphs is NP-complete
inferredcites →https://doi.org/10.1017/s0960129507006317openalex-snapshot
Quantum computation and quantum information
inferredcites →https://doi.org/10.1057/jors.1996.190openalex-snapshot
Some Applications of the Generalized Travelling Salesman Problem
inferredcites →https://doi.org/10.1057/jors.2009.76openalex-snapshot
A concise guide to the Traveling Salesman Problem
inferredcites →https://doi.org/10.1088/1367-2630/18/7/073003openalex-snapshot
Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems
inferredcites →https://doi.org/10.1098/rsta.2021.0417openalex-snapshot
Quantum annealing: an overview
inferredcites →https://doi.org/10.1103/physreva.83.032314openalex-snapshot
Experimental demonstration of a quantum annealing algorithm for the traveling salesman problem in a nuclear-magnetic-resonance quantum simulator
inferredcites →https://doi.org/10.1103/physreva.95.032323openalex-snapshot
Quantum speedup of the traveling-salesman problem for bounded-degree graphs
inferredcites →https://doi.org/10.1103/physreve.70.057701openalex-snapshot
Quantum annealing of the traveling-salesman problem
inferredcites →https://doi.org/10.1103/physrevlett.100.160501openalex-snapshot
Quantum Random Access Memory
inferredcites →https://doi.org/10.1103/physrevlett.104.020502openalex-snapshot
First-Order Phase Transition in the Quantum Adiabatic Algorithm
inferredcites →https://doi.org/10.1103/physrevlett.121.250501openalex-snapshot
Computational Speedups Using Small Quantum Devices
inferredcites →https://doi.org/10.1109/focs.2010.24openalex-snapshot
Determinant Sums for Undirected Hamiltonicity
inferredcites →https://doi.org/10.1109/focs.2011.23openalex-snapshot
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
inferredcites →https://doi.org/10.1109/icc45041.2023.10279785openalex-snapshot
Quantum Annealing Approach for Selective Traveling Salesman Problem
inferredcites →https://doi.org/10.1109/icce59016.2024.10444173openalex-snapshot
Hybrid Iterative Annealing Method Using a Quantum Annealer and a Classical Computer
inferredcites →https://doi.org/10.1109/indin.2009.5195901openalex-snapshot
An efficient Bee Colony Optimization algorithm for Traveling Salesman Problem using frequency-based pruning
inferredcites →https://doi.org/10.1109/iscmi51676.2020.9311605openalex-snapshot
On the Computational Performance of IBM Quantum Devices Applied to Combinatorial Optimisation Problems
inferredcites →https://doi.org/10.1109/ssci51031.2022.10022127openalex-snapshot
Quantum hobbit routing: Annealer implementation of generalized Travelling Salesperson Problem
inferredcites →https://doi.org/10.1109/tqe.2020.3031085openalex-snapshot
Solving the Max-Flow Problem on a Quantum Annealing Computer
inferredcites →https://doi.org/10.1126/science.1057726openalex-snapshot
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
inferredcites →https://doi.org/10.1134/s1063776123080095openalex-snapshot
A Quantum Algorithm for Solving the Travelling Salesman Problem by Quantum Phase Estimation and Quantum Search
inferredcites →https://doi.org/10.1137/0110015openalex-snapshot
A Dynamic Programming Approach to Sequencing Problems
inferredcites →https://doi.org/10.1137/1.9781611972986.8openalex-snapshot
On the Number of Hamilton Cycles in Bounded Degree Graphs
inferredcites →https://doi.org/10.1137/1.9781611975482.107openalex-snapshot
Quantum Speedups for Exponential-Time Dynamic Programming Algorithms
inferredcites →https://doi.org/10.1137/s0097539796300933openalex-snapshot
Strengths and Weaknesses of Quantum Computing
inferredcites →https://doi.org/10.1140/epjst/e2015-02339-yopenalex-snapshot
Multivariable optimization: Quantum annealing and computation
inferredcites →https://doi.org/10.1145/321105.321111openalex-snapshot
Dynamic Programming Treatment of the Travelling Salesman Problem
inferredcites →https://doi.org/10.1145/3290688.3290703openalex-snapshot
Solving the Hamiltonian Cycle Problem using a Quantum Computer
inferredcites →https://doi.org/10.1145/3449726.3463123openalex-snapshot
Focusing on the hybrid quantum computing - Tabu search algorithm
inferredcites →https://doi.org/10.1287/mnsc.11.8.b166openalex-snapshot
Three Heuristic Rules for Sequencing Jobs to a Single Production Facility
inferredcites →https://doi.org/10.1287/opre.11.6.972openalex-snapshot
An Algorithm for the Traveling Salesman Problem
inferredcites →https://doi.org/10.1287/opre.18.6.1138openalex-snapshot
The Traveling-Salesman Problem and Minimum Spanning Trees
inferredcites →https://doi.org/10.1287/opre.2.4.393openalex-snapshot
Solution of a Large-Scale Traveling-Salesman Problem
inferredcites →https://doi.org/10.1287/opre.21.2.498openalex-snapshot
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
inferredcites →https://doi.org/10.1287/opre.31.3.507openalex-snapshot
Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
inferredcites →https://doi.org/10.1287/trsc.2020.1017openalex-snapshot
Exact Methods for the Traveling Salesman Problem with Drone
inferredcites →https://doi.org/10.1515/9781400839599openalex-snapshot
In Pursuit of the Traveling Salesman
inferredcites →https://doi.org/10.2139/ssrn.4854668openalex-snapshot
Quantum Optimization Algorithms in Operations Research: Methods, Applications, and Implications
inferredcites →https://doi.org/10.3389/fict.2019.00013openalex-snapshot
A Hybrid Solution Method for the Capacitated Vehicle Routing Problem Using a Quantum Annealer
inferredcites →https://doi.org/10.3389/fphy.2014.00005openalex-snapshot
Ising formulations of many NP problems
inferredcites →https://doi.org/10.3389/fphy.2021.760783openalex-snapshot
Solving the Traveling Salesman Problem on the D-Wave Quantum Computer
inferredcites →https://doi.org/10.3390/e25081238openalex-snapshot
Comparative Study of Variations in Quantum Approximate Optimization Algorithms for the Traveling Salesman Problem
inferredcites →https://doi.org/10.3390/math10081294openalex-snapshot
Experimental Analysis of Quantum Annealers and Hybrid Solvers Using Benchmark Optimization Problems
inferredcites →https://doi.org/10.3938/jkps.61.1944openalex-snapshot
A quantum heuristic algorithm for the traveling salesman problem
inferredcites →https://doi.org/10.4230/lipics.icalp.2019.8openalex-snapshot
A Quantum Algorithm for Finding the Minimum
inferredcites →https://doi.org/10.48550/arxiv.1509.02374openalex-snapshot
Quantum walk speedup of backtracking algorithms
inferredcites →https://doi.org/10.48550/arxiv.1702.06248openalex-snapshot
Designing Adiabatic Quantum Optimization: A Case Study for the Traveling Salesman Problem
inferredcites →https://doi.org/10.48550/arxiv.1811.11538openalex-snapshot
A Tutorial on Formulating and Using QUBO Models
inferredcites →https://doi.org/10.48550/arxiv.2212.02735openalex-snapshot
A Realizable GAS-based Quantum Algorithm for Traveling Salesman Problem
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0001106openalex-snapshot
Quantum Computation by Adiabatic Evolution
inferredcites →https://doi.org/10.5860/choice.45-0928openalex-snapshot
The Traveling salesman problem: a computational study

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.55056/ceur-ws.org/vol-4049/s_48_shevchenko_derevianko_krupa_shevchenko.pdfopenalex-snapshot
Statistical Characteristics of the Reference Route Improvement Procedure Using a Stack of Iterative Methods
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.