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

Risk transportation via a clique number problem formulation

Author

Listed:
  • Mavrommatis, G.
  • Panayiotopoulos, J. -C.

Abstract

No abstract is available for this item.

Suggested Citation

  • Mavrommatis, G. & Panayiotopoulos, J. -C., 2004. "Risk transportation via a clique number problem formulation," European Journal of Operational Research, Elsevier, vol. 152(2), pages 500-506, January.
  • Handle: RePEc:eee:ejores:v:152:y:2004:i:2:p:500-506
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(03)00040-7
    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. Akgun, Vedat & Erkut, Erhan & Batta, Rajan, 2000. "On finding dissimilar paths," European Journal of Operational Research, Elsevier, vol. 121(2), pages 232-246, March.
    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. Lucio Bianco & Massimiliano Caramia & Stefano Giordani & Veronica Piccialli, 2016. "A Game-Theoretic Approach for Regulating Hazmat Transportation," Transportation Science, INFORMS, vol. 50(2), pages 424-438, May.
    2. Preethi Issac & Ann Melissa Campbell, 2017. "Shortest path problem with arc failure scenarios," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(2), pages 139-163, June.
    3. Mingyu Kim & Rajan Batta & Qing He, 2016. "Optimal routing of infiltration operations," Journal of Transportation Security, Springer, vol. 9(1), pages 87-104, June.
    4. Sandra Zajac, 2018. "On a two-phase solution approach for the bi-objective k-dissimilar vehicle routing problem," Journal of Heuristics, Springer, vol. 24(3), pages 515-550, June.
    5. Yinfeng Xu & Huili Zhang, 2015. "How much the grid network and rescuers’ communication can improve the rescue efficiency in worst-case analysis," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 1062-1076, November.
    6. Bhavsar, Nishit & Verma, Manish, 2022. "A subsidy policy to managing hazmat risk in railroad transportation network," European Journal of Operational Research, Elsevier, vol. 300(2), pages 633-646.
    7. Bell, Michael G.H., 2009. "Hyperstar: A multi-path Astar algorithm for risk averse vehicle navigation," Transportation Research Part B: Methodological, Elsevier, vol. 43(1), pages 97-107, January.
    8. Vidal, Thibaut & Laporte, Gilbert & Matl, Piotr, 2020. "A concise guide to existing and emerging vehicle routing problem variants," European Journal of Operational Research, Elsevier, vol. 286(2), pages 401-416.
    9. Carlo Prato & Shlomo Bekhor & Cristina Pronello, 2012. "Latent variables and route choice behavior," Transportation, Springer, vol. 39(2), pages 299-319, March.
    10. Maria Scaparra & Richard Church & F. Medrano, 2014. "Corridor location: the multi-gateway shortest path model," Journal of Geographical Systems, Springer, vol. 16(3), pages 287-309, July.
    11. Nielsen, Lars Relund & Andersen, Kim Allan & Pretolani, Daniele, 2014. "Ranking paths in stochastic time-dependent networks," European Journal of Operational Research, Elsevier, vol. 236(3), pages 903-914.
    12. Rongrong Li & Yee Leung & Hui Lin & Bo Huang, 2013. "An adaptive compromise programming method for multi-objective path optimization," Journal of Geographical Systems, Springer, vol. 15(2), pages 211-228, April.
    13. Bekhor, Shlomo & Prato, Carlo Giacomo, 2009. "Methodological transferability in route choice modeling," Transportation Research Part B: Methodological, Elsevier, vol. 43(4), pages 422-437, May.
    14. Fang, Kan & Ke, Ginger Y. & Verma, Manish, 2017. "A routing and scheduling approach to rail transportation of hazardous materials with demand due dates," European Journal of Operational Research, Elsevier, vol. 261(1), pages 154-168.
    15. Dell'Olmo, Paolo & Gentili, Monica & Scozzari, Andrea, 2005. "On finding dissimilar Pareto-optimal paths," European Journal of Operational Research, Elsevier, vol. 162(1), pages 70-82, April.
    16. Huili Zhang & Yinfeng Xu & Xingang Wen, 2015. "Optimal shortest path set problem in undirected graphs," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 511-530, April.
    17. Hoogeboom, Maaike & Dullaert, Wout, 2019. "Vehicle routing with arrival time diversification," European Journal of Operational Research, Elsevier, vol. 275(1), pages 93-107.
    18. Yücel, E. & Salman, F.S. & Arsik, I., 2018. "Improving post-disaster road network accessibility by strengthening links against failures," European Journal of Operational Research, Elsevier, vol. 269(2), pages 406-422.
    19. Changxi Ma & Wei Hao & Fuquan Pan & Wang Xiang, 2018. "Road screening and distribution route multi-objective robust optimization for hazardous materials based on neural network and genetic algorithm," PLOS ONE, Public Library of Science, vol. 13(6), pages 1-22, June.
    20. Pushak, Yasha & Hare, Warren & Lucet, Yves, 2016. "Multiple-path selection for new highway alignments using discrete algorithms," European Journal of Operational Research, Elsevier, vol. 248(2), pages 415-427.

    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:152:y:2004:i:2:p:500-506. 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.