A heuristic 0-1 integer programming method

DOI10.1007/BF01783498zbMath0761.90068OpenAlexW2043614379MaRDI QIDQ1190388

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

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

Cites Work

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

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