Integer Programming: Methods, Uses, Computations

Michel Balinski

Management Science, 1965, vol. 12, issue 3, 253-313

Abstract: This paper attempts to present the major methods, successful or interesting uses, and computational experience relating to integer or discrete programming problems. Included are descriptions of general algorithms for solving linear programs in integers, as well as some special purpose algorithms for use on highly structured problems. This reflects a belief, on the author's part, that various clever methods of enumeration and other specialized approaches are the most efficacious means existent by which to obtain solutions to practical problems. A serious try at gathering computational experience has been made--but facts are difficult to uncover. The paper is written with intent to enable readers to read selected sections without having to read the whole.

Date: 1965
References: Add references at CitEc
Citations: View citations in EconPapers (73)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.12.3.253 (application/pdf)

Related works:
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:inm:ormnsc:v:12:y:1965:i:3:p:253-313

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().