Generalized Equivalent Integer Programs and Canonical Problems

Bruce Faaland
Additional contact information
Bruce Faaland: University of Washington, Seattle

Management Science, 1974, vol. 20, issue 12, 1554-1560

Abstract: The theory of equivalent integer programs is generalized so that a set of minimal canonical problems always exists within each equivalence class. An example is used to demonstrate how highly computation time depends on the particular canonical problem chosen to be solved by implicit enumeration algorithms.

Date: 1974
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.20.12.1554 (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:20:y:1974:i:12:p:1554-1560

Access Statistics for this article

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