Mathematical Programming

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

Franz Rendl, Giovanni Rinaldi, Angelika Wiegele

Published Jul 21, 2008• 6 citations

Related papers

A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations

Franz Rendl, Giovanni Rinaldi, Angelika Wiegele

Improved semidefinite bounding procedure for solving Max-Cut problems to optimality

Nathan Krislock, Jérôme Malick, Frédéric Roupin

Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation

Dachuan Xu, Shu-zhong Zhang

Combining semidefinite and polyhedral relaxations for integer programs

Christoph Helmberg, Svatopluk Poljak, Franz Rendl +1 more

Solving SDP relaxations of Max-Cut problem with large number of hypermetric inequalities by L-BFGS-B

Timotej Hrga, Janez Povh

A Coherent Ising Machine for MAX-CUT Problems: Performance Evaluation against Semidefinite Programming and Simulated Annealing

Yoshitaka Haribara, Shoko Utsunomiya, Y. Yamamoto