Fetching the paper…
Reading the bibliography…
In this work, we attempt to solve the integer-weight knapsack problem using the D-Wave 2000Q adiabatic quantum computer.
E. L. Lawler, D. E. Wood, Branch-and-Bound Methods: A Survey
1966
Earlier work this paper cites.
Pincus, Martin (1970). ”A Monte-Carlo Method for the Approximate Solution of Certain Types of Constrained Optimization Problems”. Operation Research. Vol. 18 No. 6: 1225–1228
1970
Earlier work this paper cites.
R.M. Karp, Reducibility among combinatorial problems , in Complexity of Computer Computations, ed. R.E. Miller, J.W. Thatcher and J.D. Bohlinger, 85 (1972)
1972
Earlier work this paper cites.
Sahni, S. (1975). “Approximate algorithms for the 0–1 knapsack problem”, Journal of ACM
1975
Earlier work this paper cites.
M.R. Garey and D.S. Johnson. Computers and Intractability: a Guide to the Theory of NP-Completeness
1979
Earlier work this paper cites.
Y. Fu and P.W. Anderson. “Application of statistical mechanics to NP-complete problems in com- binatorial optimisation”, Journal of Physics
1986
Earlier work this paper cites.
Martello, S., Pisinger D., Toth P., New trends in exact algorithms for the 0–1 knapsack problem
2000
Earlier work this paper cites.
W. van Dam, M. Mosca, and U. Vazirani, in Proceedings of the 42nd Annual Symposium on the Foundations of Computer Science
2001
Earlier work this paper cites.
G.E. Santoro, R. Martonak, E. Tosatti, and R. Car. “Theory of quantum annealing of an Ising spin glass”, Science
2002
Cited alongside, same era.
E. Farhi, J. Goldstone, and S. Gutmann (2002), e-print quant-ph/0201031
2002
Cited alongside, same era.
H. Kellerer and U. Pferschy. Knapsack Problems
2004
Cited alongside, same era.
B. Reichardt, in Proceedings of the 36th Annual Symposium on the Theory of Computing
2004
Cited alongside, same era.
Kellerer H, Pferschy U. Knapsack Problems
2004
Cited alongside, same era.
Beier R, Vöcking B. “Random knapsack in expected polynomial time.” Proceedings of the 35th Annual ACM Symposium on the Theory of Computing, (San Diego, CA), p. 232 (2004)
2004
2009
Later among the works it cites.
B. Altshuler, H. Krovi, J. Roland, Anderson localization makes adiabatic quantum optimization fail
2010
Later among the works it cites.
Dizdar, D., Gershkov, A. and Moldovanu, B. (2011), Revenue maximization in the dynamic knapsack problem
2011
Later among the works it cites.
Lucas, A. (2014). Ising formulations of many NP-problems. Frontiers in Physics
2014
Later among the works it cites.
H. Wang, L. Wu, Ultrafast adiabatic quantum algorithm for the NP-complete exact cover problem
2016
Later among the works it cites.
J.J. Sakurai, Modern Quantum Mechanics
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
E. Farhi, J. Goldstone, S. Gutmann, and D. Nagaj, International Journal of Quantum Infor- mation 6, 503 (2008)
2008
Cited alongside, same era.
M. H. S. Amin and V. Choi (2009), e-print arXiv:0904.1387
2009
Cited alongside, same era.
P. Date, R. Patton, C. Schuman, and T. Potok. ”Efficiently embedding QUBO problems on adiabatic quantum computers” Quantum Information Processing
Cited in the paper.
Cited in the paper.
Ortega, J. ”Instances of the 0/1 Knapsack Problem,” http://artemisa.unicauca.edu.co/~johnyortega/instances_01_KP/
Cited in the paper.
Pisinger, D., ”David Pisinger’s optimization codes,” http://hjemmesider.diku.dk/~pisinger/codes.html
Cited in the paper.
2017
Later among the works it cites.
Preskill, J. ”Quantum computing in the NISQ era and beyond”, Quantum
2018
Later among the works it cites.
P. Date, D. Arthur, and L. Pusey-Nazzaro, “Qubo formulations for training machine learning models,” 2020
2020
Closest in time.