IDEAS home Printed from https://ideas.repec.org/p/ags/ndtr70/318288.html
   My bibliography  Save this paper

A Transportation Analysis Technique for National Resource Management

Author

Listed:
  • Sullivan, Edward C.

Abstract

No abstract is available for this item.

Suggested Citation

  • Sullivan, Edward C., 1973. "A Transportation Analysis Technique for National Resource Management," Transportation Research Forum Proceedings 1970s 318288, Transportation Research Forum.
  • Handle: RePEc:ags:ndtr70:318288
    DOI: 10.22004/ag.econ.318288
    as

    Download full text from publisher

    File URL: https://ageconsearch.umn.edu/record/318288/files/agecon-trf-0425.pdf
    Download Restriction: no

    File URL: https://libkey.io/10.22004/ag.econ.318288?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
    ---><---

    References listed on IDEAS

    as
    1. Stuart E. Dreyfus, 1969. "An Appraisal of Some Shortest-Path Algorithms," Operations Research, INFORMS, vol. 17(3), pages 395-412, June.
    2. M. A. Efroymson & T. L. Ray, 1966. "A Branch-Bound Algorithm for Plant Location," Operations Research, INFORMS, vol. 14(3), pages 361-368, June.
    Full references (including those not matched with items on IDEAS)

    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. Goldengorin, Boris, 2009. "Maximization of submodular functions: Theory and enumeration algorithms," European Journal of Operational Research, Elsevier, vol. 198(1), pages 102-112, October.
    2. Rolando Quintero & Esteban Mendiola & Giovanni Guzmán & Miguel Torres-Ruiz & Carlos Guzmán Sánchez-Mejorada, 2023. "Algorithm for the Accelerated Calculation of Conceptual Distances in Large Knowledge Graphs," Mathematics, MDPI, vol. 11(23), pages 1-30, November.
    3. Pijls, Wim & Post, Henk, 2009. "A new bidirectional search algorithm with shortened postprocessing," European Journal of Operational Research, Elsevier, vol. 198(2), pages 363-369, October.
    4. Harkness, Joseph & ReVelle, Charles, 2003. "Facility location with increasing production costs," European Journal of Operational Research, Elsevier, vol. 145(1), pages 1-13, February.
    5. Mazzola, Joseph B. & Neebe, Alan W., 1999. "Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type," European Journal of Operational Research, Elsevier, vol. 115(2), pages 285-299, June.
    6. Steven K. Peterson & Richard L. Church, 2008. "A Framework for Modeling Rail Transport Vulnerability," Growth and Change, Wiley Blackwell, vol. 39(4), pages 617-641, December.
    7. Yang, Jinling & Chen, Zhiwei & Criado, Regino & Zhang, Shenggui, 2024. "A mathematical framework for shortest path length computation in multi-layer networks with inter-edge weighting and dynamic inter-edge weighting: The case of the Beijing bus network, China," Chaos, Solitons & Fractals, Elsevier, vol. 182(C).
    8. Mohammad Ehsanifar & David A. Wood & Arezoo Babaie, 2021. "UTASTAR method and its application in multi-criteria warehouse location selection," Operations Management Research, Springer, vol. 14(1), pages 202-215, June.
    9. Delafield, Gemma & Smith, Greg S. & Day, Brett & Holland, Robert A. & Donnison, Caspar & Hastings, Astley & Taylor, Gail & Owen, Nathan & Lovett, Andrew, 2024. "Spatial context matters: Assessing how future renewable energy pathways will impact nature and society," Renewable Energy, Elsevier, vol. 220(C).
    10. Dimitri P. Bertsekas, 2019. "Robust shortest path planning and semicontractive dynamic programming," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(1), pages 15-37, February.
    11. Yueyue Fan & Yu Nie, 2006. "Optimal Routing for Maximizing the Travel Time Reliability," Networks and Spatial Economics, Springer, vol. 6(3), pages 333-344, September.
    12. Li‐Lian Gao & E. Powell Robinson, 1992. "A dual‐based optimization procedure for the two‐echelon uncapacitated facility location problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(2), pages 191-212, March.
    13. Martin, Larry & Hedley, H.A., 1975. "An Analysis of Structural Change in the Ontario Feed Milling Sector," Working Papers 245020, University of Guelph, Department of Food, Agricultural and Resource Economics.
    14. Monabbati, Ehsan & Kakhki, Hossein Taghizadeh, 2015. "On a class of subadditive duals for the uncapacitated facility location problem," Applied Mathematics and Computation, Elsevier, vol. 251(C), pages 118-131.
    15. Daniel Serra & Charles Revelle, 1992. "The PQ-Median problem: Location and districting of hierarchical facilities. Part I," Economics Working Papers 12, Department of Economics and Business, Universitat Pompeu Fabra.
    16. Azar Sadeghnejad-Barkousaraie & Rajan Batta & Moises Sudit, 2017. "Convoy movement problem: a civilian perspective," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(1), pages 14-33, January.
    17. Irina S. Dolinskaya, 2012. "Optimal path finding in direction, location, and time dependent environments," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(5), pages 325-339, August.
    18. Huang, He & Gao, Song, 2012. "Optimal paths in dynamic networks with dependent random link travel times," Transportation Research Part B: Methodological, Elsevier, vol. 46(5), pages 579-598.
    19. Irina S. Dolinskaya & Marina A. Epelman & Esra Şişikoğlu Sir & Robert L. Smith, 2016. "Parameter-Free Sampled Fictitious Play for Solving Deterministic Dynamic Programming Problems," Journal of Optimization Theory and Applications, Springer, vol. 169(2), pages 631-655, May.
    20. Ahuja, Ravindra & Orlin, James & Pallottino, Stefano & Scutella, Maria, 2003. "Dynamic Shortest Paths Minimizing Travel Times And Costs," Working papers 4390-02, Massachusetts Institute of Technology (MIT), Sloan School of Management.

    More about this item

    Keywords

    Public Economics;

    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:ags:ndtr70:318288. 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: AgEcon Search (email available below). General contact details of provider: http://www.trforum.org/journal/ .

    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.