Fetching the paper…
Reading the bibliography…
Quantum annealing is getting increasing attention in combinatorial optimization.
Reducibility among combinatorial problems
Richard M. Karp · 1972
Earlier work this paper cites.
Finding a maximum cut of a planar graph in polynomial time
Frank Hadlock · 1975
Earlier work this paper cites.
The ellipsoid method and its consequences in combinatorial optimization
Martin Grötschel, László Lovász, and Alexander Schrijver · 1981
Earlier work this paper cites.
On the computational complexity of Ising spin glass models
Francisco Barahona · 1982
Earlier work this paper cites.
Balancing signed toroidal graphs in polynomial time
Francisco Barahona · 1983
Earlier work this paper cites.
The max-cut problem on graphs not contractible to K 5 {K}_{5}
Francisco Barahona · 1983
Earlier work this paper cites.
A polynomial algorithm for the max-cut problem on graphs without long odd cycles
Martin Grötschel and George L. Nemhauser · 1984
Earlier work this paper cites.
On the cut polytope
Francisco Barahona and Ali Ridha Mahjoub · 1986
Earlier work this paper cites.
An application of combinatorial optimization to statistical physics and circuit layout design
Francisco Barahona, Martin Grötschel, Michael Jünger, and Gerhard Reinelt · 1988
Earlier work this paper cites.
Experiments in quadratic 0-1
Francisco Barahona, Michael Jünger, and Gerhard Reinelt · 1989
Earlier work this paper cites.
Unifying maximum cut and minimum cut of a planar graph
Wei-Kuan Shih, Sun Wu, and Yue-Sun Kuo · 1990
Earlier work this paper cites.
Optimization, approximation, and complexity classes
Christos H. Papadimitriou and Mihalis Yannakakis · 1991
Earlier work this paper cites.
Laplacian eigenvalues and the maximum cut problem
Charles Delorme and Svatopluk Poljak · 1993
Earlier work this paper cites.
The Stanford GraphBase: A platform for combinatorial computing
Donald E. Knuth · 1993
Earlier work this paper cites.
Exact ground states of Ising spin glasses: New experimental results with a branch-and-cut algorithm
Caterina De Simone, Martin Diehl, Michael Jünger, Petra Mutzel, Gerhard Reinelt, and Giovanni Rinaldi · 1995
Earlier work this paper cites.
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Michel X. Goemans and David P. Williamson · 1995
Earlier work this paper cites.
Derandomizing semidefinite programming based approximation algorithms
Sanjeev Mahajan and Hariharan Ramesh · 1995
Earlier work this paper cites.
Solving the max-cut problem using eigenvalues
Svatopluk Poljak and Franz Rendl · 1995
Earlier work this paper cites.
Exact ground states of two-dimensional ± J \pm{J} Ising spin glasses
Caterina De Simone, Martin Diehl, Michael Jünger, Petra Mutzel, Gerhard Reinelt, and Giovanni Rinaldi · 1996
Earlier work this paper cites.
https://informatik.uni-koeln.de/spinglass/, 1996
The spin glass ground state server · 1996
Cited alongside, same era.
Max cut in toroidal graphs
Anna Galluccio and Martin Loebl · 1998
Cited alongside, same era.
On the complexity of the maximum cut problem
Hans L. Bodlaender and Klaus Jansen · 2000
Cited alongside, same era.
Easy and difficult objective functions for max cut
S. Thomas McCormick, M.R. Rao, and Giovanni Rinaldi · 2003
Cited alongside, same era.
From fields to trees
Firas Hamze and Nando de Freitas · 2004
Cited alongside, same era.
Computing exact ground states of hard Ising spin glass problems by branch and cut
Frauke Liers, Michael Jünger, Gerhard Reinelt, and Giovanni Rinaldi · 2004
Cited alongside, same era.
On quadratic unconstrained binary optimization problems defined on chimera graphs
Sanjeeb Dash and Jean-François Puget · 2015
Later among the works it cites.
Panda: A software for polyhedral transformations
Stefan Lörwald and Gerhard Reinelt · 2015
Later among the works it cites.
A quantum annealing approach for fault detection and diagnosis of graph-based systems
Alejandro Perdomo-Ortiz, Joseph Fluegemann, Sriram Narasimhan, Rupak Biswas, and Vadim N. Smelyanskiy · 2015
Later among the works it cites.
A case study in programming a quantum annealer for hard operational planning problems
Eleanor G Rieffel, Davide Venturelli, Bryan O’Gorman, Minh B Do, Elicia M Prystay, and Vadim N Smelyanskiy · 2015
Later among the works it cites.
Quantum Annealing Implementation of Job-Shop Scheduling
Davide Venturelli, Dominic J. J. Marchand, and Galo Rojo · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Minor-embedding in adiabatic quantum computation: I. the parameter setting problem
Vicky Choi · 2008
Cited alongside, same era.
http://biqmac.uni-klu.ac.at, 2009
Biq mac solver – binary quadratic and max cut solver · 2009
Cited alongside, same era.
Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations
Franz Rendl, Giovanni Rinaldi, and Angelika Wiegele · 2010
Cited alongside, same era.
Approximate MRF inference using bounded treewidth subgraphs
Alexander Fix, Joyce Chen, Endre Boros, and Ramin Zabih · 2012
Cited alongside, same era.
Partitioning planar graphs: A fast combinatorial approach for max-cut
Frauke Liers and Gregor Pardella · 2012
Cited alongside, same era.
Evidence for quantum annealing with more than one hundred qubits
Sergio Boixo, Troels F. Rønnow, Sergei V. Isakov, Zhihui Wang, David Wecker, Daniel A. Lidar, John M. Martinis, and Matthias Troyer · 2013
Cited alongside, same era.
Fast clique minor generation in Chimera qubit connectivity graphs
Tomas Boothby, Andrew D. King, and Aidan Roy · 2016
Later among the works it cites.
A hybrid quantum-classical approach to solving scheduling problems
Tony T. Tran Minh Do, Eleanor G. Rieffel, Jeremy Frank, Zhihui Wang, Bryan O’Gorman, Davide Venturelli, and J. Christopher Beck · 2016
Later among the works it cites.
Benchmarking adiabatic quantum optimization for complex network analysis
Ojas Parekh, Jeremy Wendt, Luke Shulenburger, Andrew Landahl, Jonathan Moussa, and John Aidun · 2016
Later among the works it cites.
QUBO formulations for the graph isomorphism problem and related problems
Cristian S. Calude, Michael J. Dinneen, and Richard Hua · 2017
Later among the works it cites.
Ising processing units: Potential and challenges for discrete optimization
Carleton Coffrin, Harsha Nagarajan, and Russell Bent · 2017
Later among the works it cites.
Ising models for binary clustering via adiabatic quantum computing
Christian Bauckhage, Eduardo Brito, Kostadin Cvejoski, César Ojeda, Rafet Sifa, and Stefan Wrobel · 2018
Later among the works it cites.
A fixed-parameter algorithm for the max-cut problem on embedded 1-planar graphs
Christine Dahn, Nils M. Kriege, and Petra Mutzel · 2018
Later among the works it cites.
Cplex optimization studio, 2018
IBM · 2018
Later among the works it cites.
Gurobi optimizer 8.1, 2018
Gurobi Optimization · 2018
Later among the works it cites.
First results solving arbitrarily structured maximum independent set problems using quantum annealing
Sheir Yarkoni, Aske Plaat, and Thomas Bäck · 2018
Later among the works it cites.
Detecting multiple communities using quantum annealing on the D-Wave system
Christian F. A. Negre, Hayato Ushijima-Mwesigwa, and Susan M. Mniszewski · 2019
Closest in time.
Flight gate assignment with a quantum annealer
Tobias Stollenwerk, Elisabeth Lobe, and Martin Jung · 2019
Closest in time.
Quantum annealing applied to de-conflicting optimal trajectories for air traffic management
Tobias Stollenwerk, Bryan O’Gorman, Davide Venturelli, Salvatore Mandrà, Olga Rodionova, Hok K Ng, Banavar Sridhar, Eleanor G Rieffel, and Rupak Biswas · 2019
Closest in time.