An Additive Algorithm for Solving Linear Programs with Zero-One Variables

DOI10.1287/OPRE.13.4.517MaRDI QIDQ5343963zbMATH OpenOpenAlexWikidataFDO

Authors E. Balas

Publication date 1965

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.13.4.517

zbMATH Keywords

operations research

Cited in

(12)

• Total unimodularity applications in bi-objective discrete optimization
• Some new perspectives for solving 0--1 integer programming problems using balas method
• The continuous maximum capacity path interdiction problem
• An optimization model to determine master designs and runs for advertisement printing
• Interior analysis of the green product mix solution
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
• A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices
• IP over 40+ years at IBM scientific centers and marketing
• Fifty years of operational research in forestry
• Fifty Years of OR in Forestry Preface to the Special Forestry Issue of INFOR
• Foundations of operations research: from linear programming to data envelopment analysis

This page was built for publication: An Additive Algorithm for Solving Linear Programs with Zero-One Variables

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