Efficient quantum algorithm for solving travelling salesman problem: An IBM quantum experience

An Algorithm for the Traveling Salesman Problem

Little, J. D. C., Murty, K. G., Sweeney, D. W. & Karel, C · 1963

Earlier work this paper cites.

A Heuristic Approach to Solving Travelling Salesman Problems

Karg, R. L. & Thompson, G. L · 1964

Earlier work this paper cites.

Branch-and-Bound Methods: A Survey

Lawler, E. L. & Wood, D. E · 1966

Earlier work this paper cites.

The Traveling-Salesman Problem and Minimum Spanning Trees

Held, M. & Karp, R. M · 1970

Earlier work this paper cites.

Graphs and hypergraphs

Berge, Claude & Minieka, Edward · 1973

Earlier work this paper cites.

An Effective Heuristic Algorithm for the Traveling-Salesman Problem

Lin, S. & Kernighan, W · 1973

Earlier work this paper cites.

Optimization of a 532-city symmetric traveling salesman problem by branch and cut

Padberg, M. & Rinaldi, G · 1987

Earlier work this paper cites.

The selective travelling salesman problem

Laporte, G., Martello, S · 1990

Earlier work this paper cites.

A real -time solution for the traveling salesman problem using a boolean neural network

Bhide, S., John, N., & Kabuka, M. R · 1993

Earlier work this paper cites.

A Quantum Algorithm for Finding the Minimum

Durr, C., & Hoyer, P · 1996

Earlier work this paper cites.

Solving a production optimization problem in a paper-converting mill with MILP

Westerlund, T., Harjunkoski, I. & Isaksson, J · 1998

Cited alongside, same era.

Combinatorial optimization: Current successes and directions for the future

Hoffman, K. L · 2000

Cited alongside, same era.

A new heuristic optimization algorithm: Harmony search

Geem, Z. W., Kim, J. H. & Loganathan, G. V · 2001

Cited alongside, same era.

Recent Developments in Cooperative Control and Optimization

Butenko, S., Murphey, R., & Pardalos, P. M · 2003

Cited alongside, same era.

Towards Efficiently Solving Quantum Traveling Salesman Problem

Goswami, D., Karnick, H., Jain, P. & Maji, H. K · 2004

Cited alongside, same era.

NP-Hard Graph Problems’ Algorithms Testing Guidelines: Artificial Intelligence Principles and Testing as a Service

Kumlander D · 2008

The generalized covering traveling salesman problem

Shaelaie, M. H., Salari, M. & Azimi, Z. N · 2014

Later among the works it cites.

Solving a Higgs optimization problem with quantum annealing for machine learning

Mott, B., Job, J., Vlimant, J. R., Lidar, D. & Spiropulu, M · 2017

Later among the works it cites.

Optimization of lattice surgery is NP-hard

Herr, D., Nori, F. & Devitt, S. J · 2017

Later among the works it cites.

Solving Travelling Salesman Problem Using Improved Genetic Algorithm

Rana, S. & Srivastava, R. S · 2017

Later among the works it cites.

Quantum speedup of the traveling-salesman problem for bounded-degree graphs

Moylett, D. J., Linden, N. & Montanaro, A · 2017

Later among the works it cites.

Distributed Constraint Optimization Problems and Applications: A Survey

Fioretto, F., Pontelli, E. & William, Y · 2018