Fetching the paper…
Reading the bibliography…
Combinatorial optimization problems are pervasive across science and industry.
1901
Earlier work this paper cites.
1902
Earlier work this paper cites.
1903
Earlier work this paper cites.
1903
Earlier work this paper cites.
1906
Earlier work this paper cites.
1908
Earlier work this paper cites.
1908
Earlier work this paper cites.
1909
Earlier work this paper cites.
1909
Earlier work this paper cites.
1911
Earlier work this paper cites.
E. Ising, Beitrag zur Theorie des Ferromagnetismus , Z. Phys. 31
1925
Earlier work this paper cites.
H. Markowitz, Portfolio selection , The Journal of Finance 7
1952
Earlier work this paper cites.
D. J. Laughhunn, Quadratic binary programming with application to capital-budgeting problems , Operations Research 18
1970
Earlier work this paper cites.
D. Sherrington and S. Kirkpatrick, Solvable model of a spin glass , Phys. Rev. Lett. 35
1975
Earlier work this paper cites.
C. Witsgall, Mathematical Methods of site Selection for Electronic System (EMS) , NBS Internal Report (1975)
1975
Earlier work this paper cites.
J. Krarup and A. Pruzan, Computer aided layout design , Mathematical Programming Study 9
1978
Earlier work this paper cites.
W. K. Hale, Frequency assignment: Theory and applications , Proceedings of the IEEE 68
1980
Earlier work this paper cites.
G. Gallo, P. Hammer, and B. Simeone, Quadratic Knapsack Problems , Mathematical Programming 12
1980
Earlier work this paper cites.
K. Binder and A. P. Young, Spin Glasses: Experimental Facts, Theoretical Concepts and Open Questions , Rev. Mod. Phys. 58
1986
Earlier work this paper cites.
B. D. McKay, Independent sets in regular graphs of high girth , Ars Combinatoria 23A
1987
Earlier work this paper cites.
M. Grötschel, M. Jünger, and G. Reinelt, An application of combinatorial optimization to statistical physics and circuit layout design , Operations Research 36
1988
Earlier work this paper cites.
R. Boppana and M. M. Halldorsson, Approximating maximum independent sets by excluding subgraphs , BIT Numerical Mathematics 32
1992
Earlier work this paper cites.
B. Alidaee, G. A. Kochenberger, and A. Ahmadian, 0-1 quadratic programming approach for optimum solutions of two scheduling problems , International Journal of Systems Science 25
1994
Earlier work this paper cites.
M. Deza and M. Laurent, Applications of cut polyhedra , Journal of Computational and Applied Mathematics 55
1994
Earlier work this paper cites.
P. Chardaire and A. Sutter, A Decomposition Method for Quadratic Zero-One Programming , Management Science 41
1994
Earlier work this paper cites.
A. Phillips and J. B. Rosen, A quadratic assignment formulation of the molecular conformation problem , The Journal of Global Optimization 4
1994
Earlier work this paper cites.
M. X. Goemans and D. P. Williamson, Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming , J. ACM 42
1995
Earlier work this paper cites.
F. Alizadeh, Interior point methods in semidefinite programming with applications to combinatorial optimization , SIAM Journal on Optimization 5
1995
Earlier work this paper cites.
C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity (Courier Corporation, North Chelmsford, 1998)
1998
Earlier work this paper cites.
T. Kadowaki and H. Nishimori, Quantum annealing in the transverse Ising model , Phys. Rev. E 58
1998
Earlier work this paper cites.
C. Choi and Y. Ye, in Manuscript, Department of Management Sciences, University of Iowa, Iowa City, IA 52242 (2000)
2000
Earlier work this paper cites.
E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren, and D. Preda, A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem , Science 292
2001
Earlier work this paper cites.
A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. (Seffi) Naor, and B. Schieber, A unified approach to approximating resource allocation and scheduling , J. ACM 48
2001
Earlier work this paper cites.
2002
Earlier work this paper cites.
Y. Ye, The Gset Dataset , URL (2003), https://web.stanford.edu/ yyye/yyye/Gset/
2003
Earlier work this paper cites.
L. D. Iasemidis, P. M. Pardalos, D.-S. Shiau, W. Chaovalitwongse, K. Narayanan, S. Kumar, C. P. R., and J. C. Sackellares, Prediction of human epileptic seizures based on optimization and phase changes of brain electrical activity , Optimization Methods and Software 18
2003
Earlier work this paper cites.
E. Halperin, D. Livnat, and U. Zwick, MAX CUT in Cubic Graphs , J. Algorithms 53
2004
Earlier work this paper cites.
M. Gori, G. Monfardini, and F. Scarselli, in 2005 IEEE International Joint Conference on Neural Networks (IEEE, Palm Springs CA, 2005), vol. 2, p. 729
2005
Earlier work this paper cites.
V. Boginski, S. Butenko, and P. M. Pardalos, Statistical analysis of financial networks , Computational Statistics and Data Analysis 48
2005
Earlier work this paper cites.
2005
Cited alongside, same era.
2006
Cited alongside, same era.
2006
Cited alongside, same era.
A. Kolen, Interval scheduling: A survey , Naval Research Logistics 54
2007
Cited alongside, same era.
F. Scarselli, M. Gori, A. C. Tsoi, M. Hagenbuchner, and G. Monfardini, The graph neural network model , IEEE Transactions on Neural Networks 20
A. Dembo, A. Montanari, and S. Sen, Extremal cuts of sparse random graphs , The Annals of Probability 45
2017
Later among the works it cites.
H. G. Katzgraber, Viewing vanilla quantum annealing through spin glasses , Quantum Science and Technology 3
2018
Later among the works it cites.
S. Mandrà and H. G. Katzgraber, A deceptive step towards quantum speedup detection , Quantum Sci. Technol. 3
2018
Later among the works it cites.
A. Barzegar, C. Pattison, W. Wang, and H. G. Katzgraber, Optimization of population annealing Monte Carlo for large-scale spin-glass simulations , Phys. Rev. E 98
2018
Later among the works it cites.
R. Hamerly, T. Inagaki, P. L. McMahon, D. Venturelli, A. Marandi, T. Onodera, E. Ng, C. Langrock, K. Inaba, T. Honjo, et al., Scaling advantages of all-to-all connectivity in physical annealers: The Coherent Ising Machine vs. D-Wave 2000Q (2018), (arXiv:quant-phys/1805.05217)
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2008
Cited alongside, same era.
2008
Cited alongside, same era.
A. Micheli, Neural network for graphs: A contextual constructive approach , IEEE Transactions on Neural Networks 20
2009
Cited alongside, same era.
W. Duckworth and M. Zito, Large independent sets in random regular graphs , Theoretical Computer Science 410
2009
Cited alongside, same era.
2010
Cited alongside, same era.
N. Bansal and S. Khot, Inapproximability of hypergraph vertex cover and applications to scheduling problems , International Colloquium on Automata, Languages, and Programming p. 250 (2010)
2010
Cited alongside, same era.
M. W. Johnson, M. H. S. Amin, S. Gildert, T. Lanting, F. Hamze, N. Dickson, R. Harris, A. J. Berkley, J. Johansson, P. Bunyk, et al., Quantum annealing with manufactured spins , Nature 473
2011
Cited alongside, same era.
B. Korte and J. Vygen, Combinatorial Optimization , vol. 2 (Springer, New York, 2012)
2012
Cited alongside, same era.
2018
Later among the works it cites.
M. Di Ventra and F. L. Traversa, Perspective: Memcomputing: Leveraging memory and physics to compute efficiently , J. Appl. Phys. 123
2018
Later among the works it cites.
Z. Sun, Z. H. Deng, J.-Y. Nie, and J. Tang, in International Conference on Learning Representations (2018)
2018
Later among the works it cites.
2018
Later among the works it cites.
N. Choma, F. Monti, L. Gerhardt, T. Palczewski, Z. Ronaghi, P. Prabhat, W. Bhimji, M. Bronstein, S. Klein, and J. Bruna, in ICMLA (2018)
2018
Later among the works it cites.
P. Velickovic, G. Cucurull, A. Casanova, A. Romero, P. Lio, and Y. Bengio, in International Conference on Learning Representations (2018)
2018
Later among the works it cites.
K. Xu, C. Li, Y. Tian, T. Sonobe, K.-I. Kawarabayashi, and S. Jegelka, in International Conference on Machine Learning (ICML) (2018), p. 5453
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
A. Kalra, F. Qureshi, and M. Tisi, Portfolio Asset Identification Using Graph Algorithms on a Quantum Annealer , SSRN (2018), URL {https://ssrn.com/abstract=3333537}
2018
Later among the works it cites.
F. Glover, G. Kochenberger, and Y. Du, Quantum Bridge Analytics I: A Tutorial on Formulating and Using QUBO Models , 4OR 17
2019
Later among the works it cites.
M. Aramon, G. Rosenberg, T. Miyazawa, H. Tamura, and H. G. Katzgraber, Physics-inspired optimization for constraint-satisfaction problems using a digital annealer , Front. Phys. 7
2019
Later among the works it cites.
K. Xu, H. Weihua, J. Leskovec, and S. Jegelka, in International Conference on Learning Representations (2019)
2019
Later among the works it cites.
2019
Later among the works it cites.
R. Hamerly, T. Inagaki, P. L. McMahon, D. Venturelli, A. Marandi, T. Onodera, E. Ng, C. Langrock, K. Inaba, T. Honjo, et al., Experimental investigation of performance differences between coherent Ising machines and a quantum annealer , Sci. Adv. 5
2019
Later among the works it cites.
G. G. Guerreschi and A. Y. Matsuura, QAOA for Max-Cut requires hundreds of qubits for quantum speed-up , Nature Scientific Reports 9
2019
Later among the works it cites.
P. Hauke, H. G. Katzgraber, W. Lechner, H. Nishimori, and W. Oliver, Perspectives of quantum annealing: methods and implementations , Rep. Prog. Phys. 83
2020
Later among the works it cites.
A. Strokach, D. Becerra, C. Corbi-Verge, A. Perez-Riba, and P. M. Kim, Fast and flexible protein design using deep graph neural networks , Cell Systems 11
2020
Later among the works it cites.
A. Pal, C. Eksombatchai, Y. Zhou, B. Zhao, C. Rosenberg, and J. Leskovec, in PinnerSage: Multi-Modal User Embedding Framework for Recommendations at Pinterest (Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2020), p. 2311
2020
Later among the works it cites.
J. Shlomi, P. Battaglia, and J.-R. Vlimant, Graph neural networks in particle physics , Machine Learning: Science and Technology 2
2020
Later among the works it cites.
K. Mills, P. Ronagh, and I. Tamblyn, Finding the ground state of spin Hamiltonians with reinforcement learning , Nature Machine Intelligence 2
2020
Later among the works it cites.
L. Zhou, S.-T. Wang, S. Choi, H. Pichler, and M. D. Lukin, Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices , Phys. Rev. X 10
2020
Later among the works it cites.
T. Zhao, G. Carleo, J. Stokes, and S. Veerapaneni, Natural evolution strategies and variational Monte Carlo , Mach. Learn.: Sci. Technol. 2
2020
Later among the works it cites.
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
U. Alon and E. Yahav, in ICLR (2021)
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.