Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations

310 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Evidence for quantum annealing with more than one hundred qubits (2013, methodology): “[39] Rendl, F.”
50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art (2010, background): “An important contribution in this effort is documented in the paper “On the solution of discrete programming problems” by Harry Markowitz and Alan Manne [111], first published as a RAND research paper in 1956 [110].”
A fully programmable 100-spin coherent Ising machine with all-to-all connections (2016, methodology): “We used the BiqMac MAX-CUT solver (33) to compute the ground states of all the cubic graphs with N > 16.”
Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices (2018, background): “Hence, we envision that soon, QAOA can be benchmarked against classical [24, 48, 49] and semiclassical [64–66] solvers on large problem sizes with near-term quantum devices.”
Experimental investigation of performance differences between coherent Ising machines and a quantum annealer (2018, methodology): “Exact SK ground states were found with the Spin Glass Server [59], which uses BiqMac [60], an exact branch-and-bound algorithm.”