Generalized implicit enumeration using bounds on variables for solving linear programs with zero‐one variables

Stanley Zionts

Naval Research Logistics Quarterly, 1972, vol. 19, issue 1, 165-181

Abstract: In an earlier paper [1] we put forth a framework that helps to tie together a number of approaches for solving integer programming problems. We outlined there how Balas' Additive Algorithm can be explained and generalized in terms of the framework. In the present paper we review Balas' algorithm, and our earlier framework, and present an algorithm generalizing Balas' scheme. In addition, some examples are presented and future research to be done is discussed.

Date: 1972
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800190115

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:wly:navlog:v:19:y:1972:i:1:p:165-181

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().