An Additive Algorithm for Solving Linear Programs with Zero-One Variables
From MaRDI portal
Publication:5343963
DOI10.1287/opre.13.4.517zbMath0133.42701OpenAlexW2100890245WikidataQ96289570 ScholiaQ96289570MaRDI QIDQ5343963
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
Related Items (12)
Interior analysis of the green product mix solution ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ An optimization model to determine master designs and runs for advertisement printing ⋮ 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 ⋮ A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices ⋮ Total unimodularity applications in bi-objective discrete optimization ⋮ IP over 40+ years at IBM scientific centers and marketing ⋮ Some new perspectives for solving 0--1 integer programming problems using balas method ⋮ A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems ⋮ The continuous maximum capacity path interdiction problem
This page was built for publication: An Additive Algorithm for Solving Linear Programs with Zero-One Variables
