HMS: a hybrid multi-start algorithm for solving binary linear programs

DOI10.1016/J.ENDM.2018.03.002MaRDI QIDQ1791895zbMATH OpenOpenAlexWikidataFDO

Authors Josiane da Costa Vieira Rezende, M. J. F. Souza, V. N. Coelho, Alexandre X. Martins

Publication date 11 October 2018

Full work available at URL https://doi.org/10.1016/j.endm.2018.03.002

zbMATH Keywords

heuristicmulti-startconstraint propagationlocal branchingvariable neighborhood descentbinary problems

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)

Recommendations

• A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem
• A hybrid metaheuristic approach to solving the UBQP problem
• A hybrid search combining interior point methods and metaheuristics for 0-1 programming
• A hybrid of max-min ant system and linear programming for the \(k\)-covering problem
• A hybrid binary artificial bee colony algorithm for the max-bisection problem

Cites work

• Canonical Cuts on the Unit Hypercube
• GOAL solver: a hybrid local search based solver for high school timetabling
• Local branching
• LocalSolver 1.x: A black-box local-search solver for 0-1 programming
• Variable neighborhood search

Describes a project that uses

Uses Software

• GOAL
• LocalSolver
• MIPLIB

This page was built for publication: HMS: a hybrid multi-start algorithm for solving binary linear programs

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