IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v81y1998i0p379-40410.1023-a1018973511339.html
   My bibliography  Save this article

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

Author

Listed:
  • L. Escudero
  • S. Martello
  • P. Toth

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

Suggested Citation

  • L. Escudero & S. Martello & P. Toth, 1998. "On tightening 0-1 programs based on extensions ofpure 0-1 knapsack and subset-sum problems," Annals of Operations Research, Springer, vol. 81(0), pages 379-404, June.
    • Handle: RePEc:spr:annopr:v:81:y:1998:i:0:p:379-404:10.1023/a:1018973511339
    DOI: 10.1023/A:1018973511339
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018973511339
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018973511339?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Silvano Martello & Paolo Toth, 2003. "An Exact Algorithm for the Two-Constraint 0--1 Knapsack Problem," Operations Research, INFORMS, vol. 51(5), pages 826-835, October.
    2. Escudero, L. F. & Munoz, S., 2003. "On identifying dominant cliques," European Journal of Operational Research, Elsevier, vol. 149(1), pages 65-76, August.
    3. R. Lougee-Heimer & W. Adams, 2005. "A Conditional Logic Approach for Strengthening Mixed 0-1 Linear Programs," Annals of Operations Research, Springer, vol. 139(1), pages 289-320, October.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:81:y:1998:i:0:p:379-404:10.1023/a:1018973511339. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.