scientific article; zbMATH DE number 6500694

DOI10.7631/ISSN.1000-2243.2014.06.0823MaRDI QIDQ3193869zbMATH OpenFDO

Authors Geng Lin, Wenxing Zhu

Publication date 28 October 2015

Full work available at URL https://doi.org/10.7631/ISSN.1000-2243.2014.06.0823

zbMATH Keywords

heuristic algorithmlocal searchmax-bisection problemscatter search

Mathematics Subject Classification ID

Integer programming (90C10) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Advanced scatter search for the max-cut problem
• A scatter search algorithm for the maximum clique problem
• An effective iterated tabu search for the maximum bisection problem
• scientific article; zbMATH DE number 5734227
• Scatter search for the cutwidth minimization problem
• Bisection search algorithm for optimizing over the efficient set
• scientific article; zbMATH DE number 2245551
• A new Lagrangian net algorithm for solving max-bisection problems
• A 2-approximation for the maximum satisfying bisection problem

Cited in

(9)

• Bisection search algorithm for optimizing over the efficient set
• An effective iterated tabu search for the maximum bisection problem
• Scatter search. Methodology and implementation in C. With CD-ROM.
• A scatter search algorithm for the maximum clique problem
• Advanced scatter search for the max-cut problem
• scientific article; zbMATH DE number 5734227 (Why is no real title available?)
• A hybrid binary artificial bee colony algorithm for the max-bisection problem
• scientific article; zbMATH DE number 2245551 (Why is no real title available?)
• Scatter search and genetic algorithms for MAX-SAT 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 Q3193869)