IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v83y1995i1p237-244.html
   My bibliography  Save this article

A suboptimal solution to a hierarchial network design problem using dynamic programming

Author

Listed:
  • Sancho, N. G. F.

Abstract

No abstract is available for this item.

Suggested Citation

  • Sancho, N. G. F., 1995. "A suboptimal solution to a hierarchial network design problem using dynamic programming," European Journal of Operational Research, Elsevier, vol. 83(1), pages 237-244, May.
    • Handle: RePEc:eee:ejores:v:83:y:1995:i:1:p:237-244
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(94)00056-I
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Hasan Pirkul & John Current & V. Nagarajan, 1991. "The Hierarchical Network Design Problem: A New Formulation and Solution Procedures," Transportation Science, INFORMS, vol. 25(3), pages 175-182, August.
    2. Current, John R. & ReVelle, Charles S. & Cohon, Jared L., 1986. "The hierarchical network design problem," European Journal of Operational Research, Elsevier, vol. 27(1), pages 57-66, October.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Duin, C. W. & Volgenant, A., 1996. "An addendum to the hierarchical network design problem," European Journal of Operational Research, Elsevier, vol. 92(1), pages 214-216, July.
    2. Masashi Miyagawa, 2014. "Optimal allocation of area in hierarchical road networks," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 53(2), pages 617-630, September.
    3. van de Leensel, R.L.J.M. & Flippo, O.E. & Koster, Arie M.C.A. & Kolen, A.W.J., 1996. "A dynamic programming algorithm for the local access network expansion problem," Research Memorandum 027, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    4. Obreque, Carlos & Donoso, Macarena & Gutiérrez, Gabriel & Marianov, Vladimir, 2010. "A branch and cut algorithm for the hierarchical network design problem," European Journal of Operational Research, Elsevier, vol. 200(1), pages 28-35, January.
    5. Eduardo Álvarez-Miranda & Ivana Ljubić & S. Raghavan & Paolo Toth, 2015. "The Recoverable Robust Two-Level Network Design Problem," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 1-19, February.
    6. Flippo, Olaf E. & Kolen, Antoon W. J. & Koster, Arie M. C. A. & van de Leensel, Robert L. M. J., 2000. "A dynamic programming algorithm for the local access telecommunication network expansion problem," European Journal of Operational Research, Elsevier, vol. 127(1), pages 189-202, November.
    7. Gollowitzer, Stefan & Gouveia, Luis & Ljubić, Ivana, 2013. "Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities," European Journal of Operational Research, Elsevier, vol. 225(2), pages 211-222.
    8. Sancho, N. G. F., 1997. "The hierarchical network design problem with multiple primary paths," European Journal of Operational Research, Elsevier, vol. 96(2), pages 323-328, January.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Miyagawa, Masashi, 2011. "Hierarchical system of road networks with inward, outward, and through traffic," Journal of Transport Geography, Elsevier, vol. 19(4), pages 591-595.
    2. Masashi Miyagawa, 2014. "Optimal allocation of area in hierarchical road networks," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 53(2), pages 617-630, September.
    3. Gollowitzer, Stefan & Gouveia, Luis & Ljubić, Ivana, 2013. "Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities," European Journal of Operational Research, Elsevier, vol. 225(2), pages 211-222.
    4. Balakrishnan, Anantaram. & Magnanti, Thomas L. & Mirchandani, Prakash., 1991. "A dual-based algorithm for multi-level network design," Working papers 3365-91., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    5. Sancho, N. G. F., 1997. "The hierarchical network design problem with multiple primary paths," European Journal of Operational Research, Elsevier, vol. 96(2), pages 323-328, January.
    6. Eusebio Angulo & Ricardo García-Ródenas & José Luis Espinosa-Aranda, 2016. "A Lagrangian relaxation approach for expansion of a highway network," Annals of Operations Research, Springer, vol. 246(1), pages 101-126, November.
    7. Obreque, Carlos & Donoso, Macarena & Gutiérrez, Gabriel & Marianov, Vladimir, 2010. "A branch and cut algorithm for the hierarchical network design problem," European Journal of Operational Research, Elsevier, vol. 200(1), pages 28-35, January.
    8. Eduardo Álvarez-Miranda & Ivana Ljubić & S. Raghavan & Paolo Toth, 2015. "The Recoverable Robust Two-Level Network Design Problem," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 1-19, February.
    9. Mesa, Juan A. & Brian Boffey, T., 1996. "A review of extensive facility location in networks," European Journal of Operational Research, Elsevier, vol. 95(3), pages 592-603, December.
    10. T. Boffey, 1998. "Efficient solution methods for covering tree problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 6(2), pages 205-221, December.
    11. Masashi Miyagawa, 2009. "Optimal hierarchical system of a grid road network," Annals of Operations Research, Springer, vol. 172(1), pages 349-361, November.
    12. Lin, Cheng-Chang, 2010. "The integrated secondary route network design model in the hierarchical hub-and-spoke network for dual express services," International Journal of Production Economics, Elsevier, vol. 123(1), pages 20-30, January.
    13. Anantaram Balakrishnan & Thomas L. Magnanti & Prakash Mirchandani, 1998. "Designing Hierarchical Survivable Networks," Operations Research, INFORMS, vol. 46(1), pages 116-136, February.
    14. Souza, Fernanda S.H. & Gendreau, Michel & Mateus, Geraldo R., 2014. "Branch-and-price algorithm for the Resilient Multi-level Hop-constrained Network Design," European Journal of Operational Research, Elsevier, vol. 233(1), pages 84-93.
    15. Lin, Cheng-Chang & Chen, Sheu-Hua, 2004. "The hierarchical network design problem for time-definite express common carriers," Transportation Research Part B: Methodological, Elsevier, vol. 38(3), pages 271-283, March.
    16. Bigotte, João F. & Krass, Dmitry & Antunes, António P. & Berman, Oded, 2010. "Integrated modeling of urban hierarchy and transportation network planning," Transportation Research Part A: Policy and Practice, Elsevier, vol. 44(7), pages 506-522, August.
    17. J. Beasley & E. Nascimento, 1996. "The Vehicle Routing-Allocation Problem: A unifying framework," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 4(1), pages 65-86, June.
    18. Duin, C. W. & Volgenant, A., 1996. "An addendum to the hierarchical network design problem," European Journal of Operational Research, Elsevier, vol. 92(1), pages 214-216, July.
    19. Jianjun Zhang & Ou Tang & Jin Zhao & Jiazhen Huo & Yonggang Xia, 2013. "CPEL Redesigns Its Land Express Network," Interfaces, INFORMS, vol. 43(3), pages 221-231, May-June.
    20. B. Boffey & Francisco García & Gilbert Laporte & Juan Mesa & Blas Pelegrín, 1995. "Multiobjective routing problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 3(2), pages 167-220, December.

    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:eee:ejores:v:83:y:1995:i:1:p:237-244. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.