IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v106y2001i1p19-4610.1023-a1014554606793.html
   My bibliography  Save this article

Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods

Author

Listed:
  • Michel Minoux

Abstract

We first introduce a generic model for discrete cost multicommodity network optimization, together with several variants relevant to telecommunication networks such as: the case where discrete node cost functions (accounting for switching equipment) have to be included in the objective; the case where survivability constraints with respect to single-link and/or single-node failure have to be taken into account. An overview of existing exact solution methods is presented, both for special cases (such as the so-called single-facility and two-facility network loading problems) and for the general case where arbitrary step-increasing link cost-functions are considered. The basic discrete cost multicommodity flow problem (DCMCF) as well as its variant with survivability constraints (DCSMCF) are addressed. Several possible directions for improvement or future investigations are mentioned in the concluding section. Copyright Kluwer Academic Publishers 2001

Suggested Citation

  • Michel Minoux, 2001. "Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods," Annals of Operations Research, Springer, vol. 106(1), pages 19-46, September.
    • Handle: RePEc:spr:annopr:v:106:y:2001:i:1:p:19-46:10.1023/a:1014554606793
    DOI: 10.1023/A:1014554606793
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1014554606793
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1014554606793?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. Lixin Tang & Wei Jiang & Georgios Saharidis, 2013. "An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions," Annals of Operations Research, Springer, vol. 210(1), pages 165-190, November.
    2. Georgios Saharidis & Marianthi Ierapetritou, 2013. "Speed-up Benders decomposition using maximum density cut (MDC) generation," Annals of Operations Research, Springer, vol. 210(1), pages 101-123, November.
    3. Khodakaram Salimifard & Sara Bigharaz, 2022. "The multicommodity network flow problem: state of the art classification, applications, and solution methods," Operational Research, Springer, vol. 22(1), pages 1-47, March.
    4. Knippel, Arnaud & Lardeux, Benoit, 2007. "The multi-layered network design problem," European Journal of Operational Research, Elsevier, vol. 183(1), pages 87-99, November.
    5. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar & Mohammad Hassan Sharifitabar, 2015. "A Cutting-Plane Neighborhood Structure for Fixed-Charge Capacitated Multicommodity Network Design Problem," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 48-58, February.

    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:106:y:2001:i:1:p:19-46:10.1023/a:1014554606793. 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.