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

Publisher： Elsevier

ISSN： 0025-5610

Source： Mathematical Programming, Vol.121, Iss.2, 2010-02, pp. : 307-335

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A Semidefinite Programming Based Polyhedral Cut and Price Approach for the Maxcut Problem

By Krishnan Kartik Mitchell John

Computational Optimization and Applications, Vol. 33, Iss. 1, 2006-01 ,pp. : 51-71

Springer Publishing Company

Access to resources Recommend Favorite

A Tight Semidefinite Relaxation of the MAX CUT Problem

By Liu Hongwei Liu Sanyang Xu Fengmin

Journal of Combinatorial Optimization, Vol. 7, Iss. 3, 2003-09 ,pp. : 237-245

Springer Publishing Company

Access to resources Recommend Favorite

Randomized Heuristics for the Max-Cut Problem

By Festa P. Pardalos P.M. Resende M.G.C. Ribeiro C.C.

Optimization Methods and Software, Vol. 17, Iss. 6, 2002-01 ,pp. : 1033-1058

Taylor & Francis Ltd

Access to resources Recommend Favorite

On the max‐cut of sparse random graphs

RANDOM STRUCTURES AND ALGORITHMS, Vol. 52, Iss. 2, 2018-03 ,pp. : 219-262

John Wiley & Sons Inc

Access to resources Recommend Favorite

A 2^|E|/4-time algorithm for MAX-CUT

By Kulikov A. Fedin S.

Journal of Mathematical Sciences, Vol. 126, Iss. 3, 2005-03 ,pp. : 1200-1204

Springer Publishing Company

Access to resources Recommend Favorite