A Branch-and-Bound Algorithm for Zero-One Mixed Integer Programming Problems

DOI10.1287/OPRE.19.4.1036MaRDI QIDQ5633835zbMATH OpenOpenAlexFDO

Authors Ronald E. Davis, David A. Kendrick, M. 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

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11)

Cited in

(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

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