IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-0-387-30165-5_5.html
   My bibliography  Save this book chapter

Lagrangian Relax-and-Cut Algorithms

In: Handbook of Optimization in Telecommunications

Author

Listed:
  • Abilio Lucena

    (Universidade Federal do Rio de Janeiro, Departamento de Administração)

Abstract

Attempts to allow exponentially many inequalities to be candidates to Lagrangian dualization date from the early 1980s. In the literature, the term Relax-and-Cut is being used to denote the whole class of Lagrangian Relaxation algorithms where Lagrangian bounds are attempted to be improved by dynamically strengthening relaxations with the introduction of valid constraints (possibly selected from families with exponentially many constraints). In this chapter, Relax-and-Cut algorithms are reviewed in their two flavors. Additionally, a general framework to obtain feasible integral solutions (that benefit from Lagrangian bounds) is also presented. Finally, the use of Relax-and-Cut is demonstrated through an application to a hard-to-solve instance of the Knapsack Problem. For that application, Gomory cuts are used, for the first time, within a Lagrangian relaxation framework.

Suggested Citation

  • Abilio Lucena, 2006. "Lagrangian Relax-and-Cut Algorithms," Springer Books, in: Mauricio G. C. Resende & Panos M. Pardalos (ed.), Handbook of Optimization in Telecommunications, chapter 5, pages 129-145, Springer.
    • Handle: RePEc:spr:sprchp:978-0-387-30165-5_5
    DOI: 10.1007/978-0-387-30165-5_5
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:sprchp:978-0-387-30165-5_5. 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.