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

Ronald Davis, David Kendrick and Martin Weitzman

No 294535, Center for International Affairs (CIA) Archive from Harvard University, Center for International Affairs

Keywords: Research; Methods/Statistical; Methods (search for similar items in EconPapers)
Pages: 19
Date: 1967-10
References: Add references at CitEc
Citations:

Downloads: (external link)
https://ageconsearch.umn.edu/record/294535/files/harvard081.pdf (application/pdf)

Related works:
Journal Article: A Branch-and-Bound Algorithm for Zero-One Mixed Integer Programming Problems (1971)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ags:harcia:294535

DOI: 10.22004/ag.econ.294535

Access Statistics for this paper

More papers in Center for International Affairs (CIA) Archive from Harvard University, Center for International Affairs Contact information at EDIRC.
Bibliographic data for series maintained by AgEcon Search ().