Shortest-Route Methods: 2. Group Knapsacks, Expanded Networks, and Branch-and-Bound

Eric V. Denardo and Bennett L. Fox
Additional contact information
Eric V. Denardo: Yale University, New Haven, Connecticut
Bennett L. Fox: University of Montreal, Montreal, Quebec

Operations Research, 1979, vol. 27, issue 3, 548-566

Abstract: This paper contains new, fast methods for handling two types of group knapsack networks—those having only unbounded variables and those having some bounded variables. The latter are embedded in a new branch-and-bound scheme for pure integer programs. This implicit enumeration scheme is nonredundant, which distinguishes it from the literature.

Date: 1979
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.27.3.548 (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:oropre:v:27:y:1979:i:3:p:548-566

Access Statistics for this article

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