scientific article; zbMATH DE number 1786136

MaRDI QIDQ4547456zbMATH OpenFDO

Authors Igor Dukanovic

Publication date 19 September 2002

zbMATH Keywords

bipartitioncontinuous optimization heuristicsgraphMax-cut problemquasi-Newton's methodrank-two relaxation

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Methods of quasi-Newton type (90C53) Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90)

Recommendations

• Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
• Node and edge relaxations of the max-cut problem
• A NEW SECOND-ORDER CONE PROGRAMMING RELAXATION FOR MAX-CUT PROBLEMS
• A continuation algorithm for max-cut problem
• Geometry of semidefinite Max-Cut relaxations via matrix ranks

Cited in

(4)

• Lagrangian smoothing heuristics for Max-cut
• Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
• Rank of Handelman hierarchy for Max-Cut
• Global convergence of the alternating projection method for the max-cut relaxation problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4547456)