scientific article; zbMATH DE number 2245551

zbMath1086.65062MaRDI QIDQ5716604

Honggang Xue, Cheng-Xian Xu, Feng-Min Xu

Publication date: 10 January 2006

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

zbMATH Keywords

convergenceNP-hardundirected graphfeasible direction algorithmgreedy strategyNCP functionKarush-Kuhn-Tucker pointcontinuous nonlinear programming problemMax-bisection problem

Mathematics Subject Classification ID

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

Related Items (4)

A modified VNS metaheuristic for max-bisection problems ⋮ A discrete filled function algorithm for approximate global solutions of max-cut problems ⋮ A new Lagrangian net algorithm for solving max-bisection problems ⋮ A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems

This page was built for publication: