IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v76y1998i0p1-2010.1023-a1018984102311.html
   My bibliography  Save this article

Cost-efficient network synthesis from leased lines

Author

Listed:
  • Dimitris Alevras
  • Martin Grötschel
  • Roland Wessäly

Abstract

Given a communication demand between each pair of nodes of a network, we consider the problem of deciding what capacity to install on each edge of the network in order to minimize the building cost of the network and to satisfy a given demand between each pair of nodes. The feasible capacities that can be leased from a network provider are of a particular kind in our case. There are a few so-called basic capacities having the property that every basic capacity is an integral multiple of every smaller basic capacity. An edge can be equipped with a capacity only if it is an integer combination of the basic capacities. In addition, we treat several restrictions on the routings of the demands (length restriction, diversification) and failures of single nodes or single edges. We formulate the problem as a mixed integer linear programming problem and develop a cutting plane algorithm as well as several heuristics to solve it. We report on computational results for real-world data. Copyright Kluwer Academic Publishers 1998

Suggested Citation

  • Dimitris Alevras & Martin Grötschel & Roland Wessäly, 1998. "Cost-efficient network synthesis from leased lines," Annals of Operations Research, Springer, vol. 76(0), pages 1-20, January.
    • Handle: RePEc:spr:annopr:v:76:y:1998:i:0:p:1-20:10.1023/a:1018984102311
    DOI: 10.1023/A:1018984102311
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018984102311
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018984102311?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. Bernard Fortz & Martine Labbé & Francesco Maffioli, 2000. "Solving the Two-Connected Network with Bounded Meshes Problem," Operations Research, INFORMS, vol. 48(6), pages 866-877, December.
    2. Daniel Bienstock & Olga Raskina & Iraj Saniee & Qiong Wang, 2006. "Combined Network Design and Multiperiod Pricing: Modeling, Solution Techniques, and Computation," Operations Research, INFORMS, vol. 54(2), pages 261-276, April.

    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:76:y:1998:i:0:p:1-20:10.1023/a:1018984102311. 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.