IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v284y2020i2d10.1007_s10479-019-03415-8.html
   My bibliography  Save this article

Preface: decomposition methods for hard optimization problems

Author

Listed:
  • Fabio Furini

    (Université Paris Dauphine)

  • Ivana Ljubić

    (ESSEC Business School of Paris)

  • Emiliano Traversi

    (Université Paris 13 Nord)

Abstract

Divide and conquer, from Latin divide et impera, is one of the key techniques for tackling combinatorial optimization problems. It relies on the idea of decomposing complex problems into a sequence of subproblems that are then easier to handle. Decomposition techniques (such as Dantzig-Wolfe, Lagrangian, or Benders decomposition) are extremely effective in a wide range of applications, including cutting and packing, production and scheduling, routing and logistics, telecommunications, transportation, and many others. Moreover, decomposition techniques play an important role in many different fields of mixed-integer linear and non-linear optimization, multi objective optimization, optimization under uncertainty, bilevel optimization, etc. Despite the tremendous amount of research on these topics, the mathematical optimization community is constantly faced with new challenges coming from theoretical aspects and real world applications that require the development of new advanced tools.

Suggested Citation

  • Fabio Furini & Ivana Ljubić & Emiliano Traversi, 2020. "Preface: decomposition methods for hard optimization problems," Annals of Operations Research, Springer, vol. 284(2), pages 483-485, January.
    • Handle: RePEc:spr:annopr:v:284:y:2020:i:2:d:10.1007_s10479-019-03415-8
    DOI: 10.1007/s10479-019-03415-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-019-03415-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-019-03415-8?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.

    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:284:y:2020:i:2:d:10.1007_s10479-019-03415-8. 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.