A generalized Wedelin heuristic for integer programming

DOI10.1287/IJOC.1090.0328MaRDI QIDQ2899041zbMATH OpenOpenAlexFDO

Authors Oliver Bastert, Benjamin Hummel, Sven De Vries

Publication date 28 July 2012

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.1090.0328

zbMATH Keywords

algorithmsheuristicsinteger programming

Mathematics Subject Classification ID

Boolean programming (90C09) Integer programming (90C10) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• General purpose heuristics for integer programming. II
• Improved sorting-based procedure for integer programming
• General purpose heuristics for integer programming. I
• scientific article; zbMATH DE number 1312984
• scientific article; zbMATH DE number 3968333

Cited in

(4)

• General purpose heuristics for integer programming. II
• Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
• A Heuristic Ceiling Point Algorithm for General Integer Linear Programming
• Algorithms for large scale shift minimisation personnel task scheduling problems

This page was built for publication: A generalized Wedelin heuristic for integer programming

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