A Branch-and-Bound Algorithm for Zero-One Mixed Integer Programming Problems
From MaRDI portal
Publication:5633835
DOI10.1287/opre.19.4.1036zbMath0226.90033OpenAlexW2134668949MaRDI QIDQ5633835
David A. Kendrick, Ronald E. Davis, Martin L. Weitzman
Publication date: 1971
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: http://ageconsearch.umn.edu/record/294535
Related Items (2)
Improved penalty calculations for a mixed integer branch-and-bound algorithm ⋮ Minimum cost upgrade of phasor measurement unit networks for synchrophasor availability
This page was built for publication: A Branch-and-Bound Algorithm for Zero-One Mixed Integer Programming Problems