scientific article; zbMATH DE number 2245551

MaRDI QIDQ5716604zbMATH OpenFDO

Authors H. Xue, Feng-Min Xu, Cheng-Xian Xu

Publication date 10 January 2006

zbMATH Keywords

continuous nonlinear programming problemconvergencefeasible direction algorithmgreedy strategyKarush-Kuhn-Tucker pointMax-bisection problemNCP functionNP-hardundirected graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Numerical mathematical programming methods (65K05) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• A feasible direction algorithm for max bisection via low-rank factorization
• scientific article; zbMATH DE number 5734227
• A multiple penalty function method for solving max-bisection problems
• scientific article; zbMATH DE number 5232308
• scientific article; zbMATH DE number 6500694

Cited in

(8)

• A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems
• A multiple penalty function method for solving max-bisection problems
• A deterministic annealing algorithm for approximating a solution of the min-bisection problem
• scientific article; zbMATH DE number 6500694 (Why is no real title available?)
• A feasible direction algorithm for max bisection via low-rank factorization
• A new Lagrangian net algorithm for solving max-bisection problems
• A modified VNS metaheuristic for max-bisection problems
• A discrete filled function algorithm for approximate global solutions of max-cut problems

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