On tightening 0-1 programs based on extensions ofpure 0-1 knapsack and subset-sum problems

L. Escudero, S. Martello and P. Toth

Annals of Operations Research, 1998, vol. 81, issue 0, 379-404

Abstract: We present a framework for automatic tightening of general 0-1 programs. A givenconstraint is tightened by using its own structure as well as information from the other constraints.Our approach exploits special structures that are frequently encountered in practicalproblems, namely knapsack constraints, cliques, covers, variable covers and variable upperbounds. We consider 0-1 knapsack and subset-sum problems with clique and cover inducedconstraints. The tightening (reduction and increasing) of constraint coefficients benefits fromimplication results due to probing analysis. Some computational experience is reported onwell-known real-life problems as well as on a new set of large-scale problems from theinvestment planning sector. Copyright Kluwer Academic Publishers 1998

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

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018973511339 (text/html)
Access to full text is restricted to subscribers.

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:spr:annopr:v:81:y:1998:i:0:p:379-404:10.1023/a:1018973511339

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018973511339

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().