IDEAS home Printed from https://ideas.repec.org/p/cor/louvco/1997020.html
   My bibliography  Save this paper

The 0-1 knapsack problem with a single continuous variable

Author

Listed:
  • MARCHAND, Hugues

    (Columbia Business School, New York. Supported by a CIM Doctoral Fellowship)

  • WOLSEY, Laurence A.

    (Center for Operations Research and Econometrics (CORE), Université catholique de Louvain (UCL), Louvain la Neuve, Belgium)

Abstract

Constraints arising in practice often contain many 0-1 variables and one or a small number of continuous variables. Existing knapsack separation routines cannot be used on such constraints. Here we study such constraint sets, and derive valid inequalities that can be used as cuts for such sets, as well for more general mixed 0-1 constraints. Specifically we investigate the polyhedral structure of the knapsack problem with a single continuous variable, called the continuous 0-1 knapsack problem. First different classes of facet-defining inequalities are derived based on pro jection and lifting. The order of lifting, particularly of the continuous variable, plays an important role. Secondly we show that the flow cover inequalities derived for the single node flow set, consisting of arc flows into and out of a single node with binary variable lower and upper bounds on each arc, can be obtained from valid inequalities for the continuous 0-1 knapsack problem. Thus the separation heuristic we derive for continuous knapsack sets can also be used to derive cuts for more general mixed 0-1 constraints. Initial computational results on a variety of problems are presented.

Suggested Citation

  • MARCHAND, Hugues & WOLSEY, Laurence A., 1997. "The 0-1 knapsack problem with a single continuous variable," LIDAM Discussion Papers CORE 1997020, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvco:1997020
    as

    Download full text from publisher

    File URL: https://sites.uclouvain.be/core/publications/coredp/coredp1997.html
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. CERIA, Sebastian & CORDIER, Cecile & MARCHAND, Hugues & WOLSEY, Laurence, 1995. "Cutting Planes for Integer Programs with General Integer Variables," LIDAM Discussion Papers CORE 1995075, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      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:cor:louvco:1997020. 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.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.html .

      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.