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

DOI10.1016/j.endm.2018.03.002zbMath1408.90335OpenAlexW2798165828MaRDI QIDQ1791895

Josiane da Costa Vieira Rezende, Marcone Jamilson Freitas Souza, Alexandre Xavier Martins, Vitor N. Coelho

Publication date: 11 October 2018

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

zbMATH Keywords

constraint propagationheuristicmulti-startvariable neighborhood descentlocal branchingbinary problems

Mathematics Subject Classification ID

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

Uses Software

• MIPLIB
• LocalSolver
• GOAL

Cites Work

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

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