A multiple penalty function method for solving max-bisection problems
From MaRDI portal
Publication:2489432
DOI10.1016/j.amc.2005.04.012zbMath1090.65080MaRDI QIDQ2489432
Honggang Xue, Feng-Min Xu, Cheng-Xian Xu
Publication date: 28 April 2006
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2005.04.012
semidefinite programming; numerical examples; max-bisection problem; circuit partitioning problem; multiple penalty functions
90C35: Programming involving graphs or networks
65K05: Numerical mathematical programming methods
90C22: Semidefinite programming
90C30: Nonlinear programming
Cites Work
- Solving the max-cut problem using eigenvalues
- Some NP-complete problems in quadratic and nonlinear programming
- A special newton-type optimization method
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- 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