scientific article; zbMATH DE number 5232308

zbMath1133.65034MaRDI QIDQ5440597

Xiaoliang He, Cheng-Xian Xu, Feng-Min Xu

Publication date: 5 February 2008

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmconvergencenumerical experimentseigenvectorsnonlinear programmingLaplacian matrixfeasible direction methodmax-cut problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Combinatorial optimization (90C27)

Related Items

A new discrete filled function method for solving large scale max-cut problems, A discrete filled function algorithm for approximate global solutions of max-cut problems, A discrete dynamic convexized method for the max-cut problem, A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems

Uses Software

• SDPpack
• CirCut