Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach

Manfred W. Padberg

Naval Research Logistics Quarterly, 1972, vol. 19, issue 4, 699-708

Abstract: In this paper we show that every bounded integer linear program can be transformed into an integer program involving one single linear constraint and upper and lower bounds on the variables, such that the solution space of the original problem coincides with that one of the equivalent knapsack‐type problem.

Date: 1972
References: Add references at CitEc
Citations:

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

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:4:p:699-708

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 ().