A new Lagrangian net algorithm for solving max-bisection problems

DOI10.1016/j.cam.2011.01.015zbMath1220.05029OpenAlexW2066635959MaRDI QIDQ544198

Baili Chen, Xusheng Ma, Feng-Min Xu

Publication date: 14 June 2011

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2011.01.015

zbMATH Keywords

discrete Hopfield networkmax-bisection problemmultiplier penalty function

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

An effective iterated tabu search for the maximum bisection problem ⋮ Memetic search for the max-bisection problem ⋮ Speeding up a memetic algorithm for the max-bisection problem

Uses Software

• SDPpack

Cites Work

• ``Neural computation of decisions in optimization problems
• Neural networks in optimization
• Some NP-complete problems in quadratic and nonlinear programming
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research
• A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
• A .699-approximation algorithm for Max-Bisection.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A new Lagrangian net algorithm for solving max-bisection problems