IDEAS home Printed from https://ideas.repec.org/a/sae/envira/v5y1973i4p519-533.html
   My bibliography  Save this article

Optimal Network Problem: A Branch-and-Bound Algorithm

Author

Listed:
  • D E Boyce

    (Regional Science Department, University of Pennsylvania, Philadelphia, Pennsylvania 19104, USA)

  • A Farhi

    (SESAME, 48 Boulevard de Latour Maubourg, 75-Paris, France)

  • R Weischedel

    (Moore School of Electrical Engineering, University of Pennsylvania, Philadelphia, Pennsylvania 19104, USA)

Abstract

The problem of selecting a subset of links so as to minimize the sum of shortest path distances between all pairs of nodes, subject to a budget constraint on total length of links, may be solved by a modification of a branch-and-bound algorithm developed for optimal variable selection problems in statistics. The modified algorithm is described in detail, and encouraging computational experience on 10 node networks is reported. The use of the algorithm as a heuristic approach to solving the optimal network problem is also discussed.

Suggested Citation

  • D E Boyce & A Farhi & R Weischedel, 1973. "Optimal Network Problem: A Branch-and-Bound Algorithm," Environment and Planning A, , vol. 5(4), pages 519-533, August.
    • Handle: RePEc:sae:envira:v:5:y:1973:i:4:p:519-533
    DOI: 10.1068/a050519
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1068/a050519
    Download Restriction: no
    File URL: https://libkey.io/10.1068/a050519?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Gao, Ziyou & Wu, Jianjun & Sun, Huijun, 2005. "Solution algorithm for the bi-level discrete network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 39(6), pages 479-495, July.
    2. Makoto Okumura & Makoto Tsukai, 2005. "Robustness of optimal inter-city railway network structure in Japan against alternative population distributions," ERSA conference papers ersa05p497, European Regional Science Association.
    3. Hamid Farvaresh & Mohammad Sepehri, 2013. "A Branch and Bound Algorithm for Bi-level Discrete Network Design Problem," Networks and Spatial Economics, Springer, vol. 13(1), pages 67-106, March.

    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:sae:envira:v:5:y:1973:i:4:p:519-533. 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: SAGE Publications (email available below). General contact details of provider: .

    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.