Fetching the paper…
Reading the bibliography…
Combinatorial optimization problems are one of the target applications of current quantum technology, mainly because of their industrial relevance, the difficulty of solving large instances of them classically, and their equivalence to Ising Hamiltonians using the quadratic unconstrained binary optimization (QUBO) formulation.
Technical Report P-510
G Dantzig, R Fulkerson, and S Johnson · 1954
Earlier work this paper cites.
Solution of a large-scale traveling-salesman problem
George B. Dantzig, Richard M. Fulkerson, and Selmer M. Johnson · 1954
Earlier work this paper cites.
The truck dispatching problem
G Dantzig and JH Ramser · 1959
Earlier work this paper cites.
Dynamic programming treatment of the travelling salesman problem
Richard Bellman · 1962
Earlier work this paper cites.
A dynamic programming approach to sequencing problems
Michael Held and Richard M. Karp · 1962
Earlier work this paper cites.
Optimization by simulated annealing
S. Kirkpatrick, C.D. Gelatt Jr, and M.P. Vecchi · 1983
Earlier work this paper cites.
A direct search optimization method that models the objective and constraint functions by linear interpolation
M.J.D. Powell · 1994
Earlier work this paper cites.
Astro-fold: a combinatorial and global optimization framework for ab initio prediction of three-dimensional structures of proteins from the amino acid sequence
John L Klepeis and Christodoulos A Floudas · 2003
Earlier work this paper cites.
The traveling salesman problem: A computational study
D. L. Applegate, R. E. Bixby, V. Chvátal, and W. J. Cook · 2006
Earlier work this paper cites.
In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation
William J. Cook · 2006
Earlier work this paper cites.
The worst-case time complexity for generating all maximal cliques and computational experiments
E. Tomita, A. Tanaka, and H. Takahashi · 2007
Earlier work this paper cites.
Combinatorial optimization design and operating management mechanisms for logistics supply chain management
Yan Ling Wang · 2010
Cited alongside, same era.
A practical heuristic for finding graph minors
Jun Cai, William G. Macready, and Aidan Roy · 2014
Cited alongside, same era.
The unconstrained binary quadratic programming problem: A survey
Gary Kochenberger, Jin Kao Hao, Fred Glover, Mark Lewis, Zhipeng Lü, Haibo Wang, and Yang Wang · 2014
Cited alongside, same era.
Ising formulations of many NP problems
Andrew Lucas · 2014
Cited alongside, same era.
Optimization Methods in Finance, Second edition
Gérard Cornuéjols, Javier Peña, and Reha Tütüncü · 2018
Cited alongside, same era.
Quantum Bridge Analytics I: a tutorial on formulating and using QUBO models
Fred Glover, Gary Kochenberger, and Yu Du · 2019
Cited alongside, same era.
Ibm ilog cplex optimizer
IBM · 2021
Later among the works it cites.
Solving the Traveling Salesman Problem on the D-Wave Quantum Computer
Siddharth Jain · 2021
Later among the works it cites.
Simulating Quantum Systems on D-Wave Hardware Bachelorarbeit in Physik angefertigt im Helmholtz-Institut für Strahlen- und Kernphysik Mathematisch-Naturwissenschaftlichen Fakultät Rheinischen Friedrich-Wilhelms-Universität
Luca Gawalleck · 2022
Later among the works it cites.
An investigation of IBM quantum computing device performance on combinatorial optimisation problems
Maxine T. Khumalo, Hazel A. Chieza, Krupa Prag, and Matthew Woolway · 2022
Later among the works it cites.
Unbalanced penalization: A new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms
Alejandro Montanez-Barrera, Alberto Maldonado-Romo, Dennis Willsch, and Kristel Michielsen · 2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Solving Fuzzy Job-Shop Scheduling Problem Using de Algorithm Improved by a Selection Mechanism
Da Gao, Gai Ge Wang, and Witold Pedrycz · 2020
Cited alongside, same era.
Breaking limitation of quantum annealer in solving optimization problems under constraints
Masayuki Ohzeki · 2020
Cited alongside, same era.
Operations Research
Richard J Boucherie, Aleida Braaksma, and Henk Tijms · 2021
Cited alongside, same era.
Garden optimization problems for benchmarking quantum annealers
Carlos D. Gonzalez Calaza, Dennis Willsch, and Kristel Michielsen · 2021
Cited alongside, same era.
Quantum approximate optimization of non-planar graph problems on a planar superconducting processor
Matthew P. Harrigan, Kevin J. Sung, Matthew Neeley, Kevin J. Satzinger, Frank Arute, Kunal Arya, Juan Atalaya, Joseph C. Bardin, Rami Barends, Sergio Boixo, Michael Broughton, Bob B. Buckley, David A. Buell, Brian Burkett, Nicholas Bushnell, Yu Chen, Zijun Chen, Ben Chiaro, Roberto Collins, William Courtney, Sean Demura, Andrew Dunsworth, Daniel Eppens, Austin Fowler, Brooks Foxen, Craig Gidney, Marissa Giustina, Rob Graff, Steve Habegger, Alan Ho, Sabrina Hong, Trent Huang, L. B. Ioffe, Sergei V. Isakov, Evan Jeffrey, Zhang Jiang, Cody Jones, Dvir Kafri, Kostyantyn Kechedzhi, Julian Kelly, Seon Kim, Paul V. Klimov, Alexander N. Korotkov, Fedor Kostritsa, David Landhuis, Pavel Laptev, Mike Lindmark, Martin Leib, Orion Martin, John M. Martinis, Jarrod R. McClean, Matt McEwen, Anthony Megrant, Xiao Mi, Masoud Mohseni, Wojciech Mruczkiewicz, Josh Mutus, Ofer Naaman, Charles Neill, Florian Neukart, Murphy Yuezhen Niu, Thomas E. O’Brien, Bryan O’Gorman, Eric Ostby, Andre Petukhov, Harald Putterman, Chris Quintana, Pedram Roushan, Nicholas C. Rubin, Daniel Sank, Andrea Skolik, Vadim Smelyanskiy, Doug Strain, Michael Streif, Marco Szalay, Amit Vainsencher, Theodore White, Z. Jamie Yao, Ping Yeh, Adam Zalcman, Leo Zhou, Hartmut Neven, Dave Bacon, Erik Lucero, Edward Farhi, and Ryan Babbush
Cited in the paper.
Dynamic portfolio optimization with real datasets using quantum processors and quantum-inspired tensor networks
Samuel Mugel, Carlos Kuchkovsky, Escolástico Sánchez, Samuel Fernández-Lorenzo, Jorge Luis-Hita, Enrique Lizaso, and Román Orús · 2022
Later among the works it cites.
Constrained Quantum Optimization for Extractive Summarization on a Trapped-ion Quantum Computer
Pradeep Niroula, Ruslan Shaydulin, Romina Yalovetzky, Pierre Minssen, Dylan Herman, Shaohan Hu, and Marco Pistoia · 2022
Later among the works it cites.
Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems
Dennis Willsch, Madita Willsch, Carlos D. Gonzalez Calaza, Fengping Jin, Hans De Raedt, Marika Svensson, and Kristel Michielsen · 2022
Later among the works it cites.
D-wave system documentation
D-Wave Systems Inc · 2023
Closest in time.
Application-Oriented Performance Benchmarks for Quantum Computing
Thomas Lubinski, Sonika Johri, Paul Varosy, Jeremiah Coleman, Luning Zhao, Jason Necaise, Charles H. Baldwin, Karl Mayer, and Timothy Proctor · 2023
Closest in time.