IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v19y1973i5p488-498.html
   My bibliography  Save this article

A Computational Approach to the Selection of an Optimal Network

Author

Listed:
  • Hoang Hai Hoc

    (University of Montreal)

Abstract

We consider the problem of selecting an optimal traffic network in its simplest form, where there are no congestion costs. The superadditive effect of deleted links on the objective function is pointed out and used to develop some implicit enumeration procedures for this problem. Some efforts are devoted to evaluate these algorithms, and to show how to stop the computations with an "acceptable" approximate solution when computations are taking too much time.

Suggested Citation

  • Hoang Hai Hoc, 1973. "A Computational Approach to the Selection of an Optimal Network," Management Science, INFORMS, vol. 19(5), pages 488-498, January.
  • Handle: RePEc:inm:ormnsc:v:19:y:1973:i:5:p:488-498
    DOI: 10.1287/mnsc.19.5.488
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.19.5.488
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.19.5.488?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
    ---><---

    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:inm:ormnsc:v:19:y:1973:i:5:p:488-498. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.