A modified VNS metaheuristic for max-bisection problems

DOI10.1016/j.cam.2007.08.018zbMath1148.65040OpenAlexW1975241577MaRDI QIDQ939544

Le Tang, Ai-Fan Ling, Cheng-Xian Xu

Publication date: 22 August 2008

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.2007.08.018

zbMATH Keywords

combinatorial optimizationlocal searchvariable neighborhood searchmax-cut problemheuristic methodmax-bisection problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (5)

An effective iterated tabu search for the maximum bisection problem ⋮ Memetic search for the max-bisection problem ⋮ Variable neighbourhood search: methods and applications ⋮ Variable neighbourhood search: Methods and applications ⋮ Speeding up a memetic algorithm for the max-bisection problem

Uses Software

• SDPpack

Cites Work

• Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
• Variable neighborhood search
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Randomized heuristics for the Max-Cut problem
• 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

This page was built for publication: A modified VNS metaheuristic for max-bisection problems