A heuristic 0-1 integer programming method

DOI10.1007/BF01783498MaRDI QIDQ1190388zbMATH OpenOpenAlexFDO

Authors Felix Baessler

Publication date 26 September 1992

Published in OR Spektrum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01783498

zbMATH Keywords

heuristiclarge search treessolution probability

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10) Boolean programming (90C09)

Recommendations

• A simple strategy for solving a class of 0-1 integer programming models
• A heuristic with tie breaking for certain 0–1 integer programming models
• scientific article; zbMATH DE number 1094193
• Mathematical programming based heuristics for the 0--1 MIP: a survey
• Probabilistic approach to assessment of heuristics in 0?1 linear programming

Cites work

• A necessary and sufficient condition for the aggregation of linear Diophantine equations

Cited in

(5)

• Octane: A New Heuristic for Pure 0–1 Programs
• A heuristic with tie breaking for certain 0–1 integer programming models
• AN INTEGRAL HEURISTIC
• Probabilistic approach to assessment of heuristics in 0?1 linear programming
• A simple strategy for solving a class of 0-1 integer programming models

This page was built for publication: A heuristic 0-1 integer programming method

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