Randomized Heuristics for the Max-Cut Problem

Author： Festa P.   Pardalos P.M.   Resende M.G.C.   Ribeiro C.C.  

Publisher： Taylor & Francis Ltd

ISSN： 1055-6788

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

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

On the max‐cut of sparse random graphs

By  

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

John Wiley & Sons Inc

Access to resources Recommend Favorite

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 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

An efficient Lagrangian smoothing heuristic for Max-Cut

By Xia Yong  

Indian Journal of Pure and Applied Mathematics, Vol. 41, Iss. 5, 2010-10 ,pp. : 683-700

Springer Publishing Company

Access to resources Recommend Favorite

Improved approximation of Max-Cut on graphs of bounded degree

By Feige U.   Karpinski M.   Langberg M.  

Journal of Algorithms, Vol. 43, Iss. 2, 2002-05 ,pp. : 201-219

Academic Press

Access to resources Recommend Favorite