A hybrid binary artificial bee colony algorithm for the max-bisection problem

MaRDI QIDQ5210151zbMATH OpenFDO

Authors Geng Lin

Publication date 22 January 2020

zbMATH Keywords

artificial bee colony algorithmfilled functionlocal searchmax-bisection

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 6500694
• A modified VNS metaheuristic for max-bisection problems
• A new Lagrangian net algorithm for solving max-bisection problems
• scientific article; zbMATH DE number 5734227
• A multiple penalty function method for solving max-bisection problems

Cited in

(3)

• HMS: a hybrid multi-start algorithm for solving binary linear programs
• An artificial bee colony algorithm for the maximally diverse grouping problem
• A modified VNS metaheuristic for max-bisection problems

This page was built for publication: A hybrid binary artificial bee colony algorithm for the max-bisection problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5210151)