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

Dynamic programming and minimum risk paths

Author

Listed:
  • Serafini, Paolo

Abstract

No abstract is available for this item.

Suggested Citation

  • Serafini, Paolo, 2006. "Dynamic programming and minimum risk paths," European Journal of Operational Research, Elsevier, vol. 175(1), pages 224-237, November.
    • Handle: RePEc:eee:ejores:v:175:y:2006:i:1:p:224-237
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00418-2
    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. K. R. Baker & E. L. Lawler & J. K. Lenstra & A. H. G. Rinnooy Kan, 1983. "Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints," Operations Research, INFORMS, vol. 31(2), pages 381-386, April.
    2. Erhan Erkut & Vedat Verter, 1998. "Modeling of Transport Risk for Hazardous Materials," Operations Research, INFORMS, vol. 46(5), pages 625-642, 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. Mohri, Seyed Sina & Mohammadi, Mehrdad & Gendreau, Michel & Pirayesh, Amir & Ghasemaghaei, Ali & Salehi, Vahid, 2022. "Hazardous material transportation problems: A comprehensive overview of models and solution approaches," European Journal of Operational Research, Elsevier, vol. 302(1), pages 1-38.
    2. Lei Gao & Dong Han, 2020. "Extreme Value Distributions for Two Kinds of Path Sums of Markov Chain," Methodology and Computing in Applied Probability, Springer, vol. 22(1), pages 279-294, March.

    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. P. Daniel Wright & Matthew J. Liberatore & Robert L. Nydick, 2006. "A Survey of Operations Research Models and Applications in Homeland Security," Interfaces, INFORMS, vol. 36(6), pages 514-529, December.
    2. Duque, Daniel & Lozano, Leonardo & Medaglia, Andrés L., 2015. "An exact method for the biobjective shortest path problem for large-scale road networks," European Journal of Operational Research, Elsevier, vol. 242(3), pages 788-797.
    3. Alexander Grigoriev & Martijn Holthuijsen & Joris van de Klundert, 2005. "Basic scheduling problems with raw material constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(6), pages 527-535, September.
    4. Szeto, W.Y. & Farahani, R.Z. & Sumalee, Agachai, 2017. "Link-based multi-class hazmat routing-scheduling problem: A multiple demon approach," European Journal of Operational Research, Elsevier, vol. 261(1), pages 337-354.
    5. Amirsaman Kheirkhah & HamidReza Navidi & Masume Messi Bidgoli, 2016. "A bi-level network interdiction model for solving the hazmat routing problem," International Journal of Production Research, Taylor & Francis Journals, vol. 54(2), pages 459-471, January.
    6. Nathalie de Marcellis-Warin & Ingrid Peignier & Marie-Hélène Leroux & Martin Trépanier, 2010. "Analyse des résultats d'une enquête auprès des entreprises faisant du transport routier de matières dangereuses au Québec," CIRANO Project Reports 2010rp-14, CIRANO.
    7. Hosseini, S. Davod & Verma, Manish, 2018. "Conditional value-at-risk (CVaR) methodology to optimal train configuration and routing of rail hazmat shipments," Transportation Research Part B: Methodological, Elsevier, vol. 110(C), pages 79-103.
    8. Zajac, Sandra & Huber, Sandra, 2021. "Objectives and methods in multi-objective routing problems: a survey and classification scheme," European Journal of Operational Research, Elsevier, vol. 290(1), pages 1-25.
    9. Santos Peñate, D.R. & Suárez-Vega, R. & Dorta González, P., 2001. "Un modelo de decisión multicriterio para la localización de centros de tratamiento de residuos," Estudios de Economia Aplicada, Estudios de Economia Aplicada, vol. 17, pages 163-182, Abril.
    10. Erhan Erkut & Armann Ingolfsson, 2000. "Catastrophe Avoidance Models for Hazardous Materials Route Planning," Transportation Science, INFORMS, vol. 34(2), pages 165-179, May.
    11. Zhao, Jiahong & Ke, Ginger Y., 2017. "Incorporating inventory risks in location-routing models for explosive waste management," International Journal of Production Economics, Elsevier, vol. 193(C), pages 123-136.
    12. Kumar, Anand & Roy, Debjit & Verter, Vedat & Sharma, Dheeraj, 2018. "Integrated fleet mix and routing decision for hazmat transportation: A developing country perspective," European Journal of Operational Research, Elsevier, vol. 264(1), pages 225-238.
    13. Assadipour, Ghazal & Ke, Ginger Y. & Verma, Manish, 2015. "Planning and managing intermodal transportation of hazardous materials with capacity selection and congestion," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 76(C), pages 45-57.
    14. Yates, Justin & Sanjeevi, Sujeevraja, 2013. "A length-based, multiple-resource formulation for shortest path network interdiction problems in the transportation sector," International Journal of Critical Infrastructure Protection, Elsevier, vol. 6(2), pages 107-119.
    15. Yu Zhang & Nan Liu, 2021. "Optimal Internet of Things Technology Adoption Decisions and Pricing Strategies for High-Traceability Logistics Services," Sustainability, MDPI, vol. 13(19), pages 1-33, September.
    16. Sharaf AlKheder, 2022. "Risk assessment of fuel energy transportation in Kuwait," Journal of Transportation Security, Springer, vol. 15(3), pages 223-243, December.
    17. Francis Sourd & Wim Nuijten, 2000. "Multiple-Machine Lower Bounds for Shop-Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 12(4), pages 341-352, November.
    18. Sina Abbasi & Mojdeh Ardeshir Nasabi & Ilias Vlachos & Fatemeh Eshghi & Mahdi Hazrati & Sajjad Piryaei, 2024. "Designing a Sustainable Nonlinear Model Considering a Piecewise Function for Solving the Risk of Hazardous Material Routing-Locating Problem," Sustainability, MDPI, vol. 16(10), pages 1-16, May.
    19. Zhang, Jianjun & Hodgson, John & Erkut, Erhan, 2000. "Using GIS to assess the risks of hazardous materials transport in networks," European Journal of Operational Research, Elsevier, vol. 121(2), pages 316-329, March.
    20. Janiak, Adam & Kovalyov, Mikhail Y., 2006. "Scheduling in a contaminated area: A model and polynomial algorithms," European Journal of Operational Research, Elsevier, vol. 173(1), pages 125-132, August.

    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:175:y:2006:i:1:p:224-237. 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.