{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:41:01Z","timestamp":1786981261254,"version":"build-2736575974"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,5,13]],"date-time":"2014-05-13T00:00:00Z","timestamp":1399939200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s10878-014-9751-z","type":"journal-article","created":{"date-parts":[[2014,5,12]],"date-time":"2014-05-12T08:57:27Z","timestamp":1399885047000},"page":"320-334","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Robust optimization for the hazardous materials transportation network design problem"],"prefix":"10.1007","volume":"30","author":[{"given":"Chunlin","family":"Xin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Letu","family":"Qingge","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiamin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Binhai","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,5,13]]},"reference":[{"key":"9751_CR1","unstructured":"China Chemical Safety Association. http:\/\/www.chemicalsafety.org.cn"},{"issue":"2","key":"9751_CR2","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1287\/trsc.1030.0065","volume":"38","author":"BY Kara","year":"2004","unstructured":"Kara BY, Verter V (2004) Designing a road network for hazardous materials transportation. Transp Sci 38(2):188\u2013196","journal-title":"Transp Sci"},{"issue":"5","key":"9751_CR3","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1016\/j.cor.2005.06.007","volume":"34","author":"E Erkut","year":"2007","unstructured":"Erkut E, Alp O (2007) Designing a road network for hazardous materials shipments. Comput Oper Res 34(5):1389\u20131405","journal-title":"Comput Oper Res"},{"issue":"7","key":"9751_CR4","doi-asserted-by":"crossref","first-page":"2234","DOI":"10.1016\/j.cor.2006.10.022","volume":"35","author":"E Erkut","year":"2008","unstructured":"Erkut E, Gzara F (2008) Solving the hazmat transport network design problem. Comput Oper Res 35(7):2234\u20132247","journal-title":"Comput Oper Res"},{"issue":"1","key":"9751_CR5","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1287\/mnsc.1070.0763","volume":"54","author":"V Verter","year":"2008","unstructured":"Verter V, Kara BY (2008) A path-based approach for hazmat transport network design. Manag Sci 54(1):29\u201340","journal-title":"Manag Sci"},{"key":"9751_CR6","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/978-3-642-21527-8_38","volume":"6701","author":"E Amaldi","year":"2011","unstructured":"Amaldi E, Bruglieri M, Fortz B (2011) On the hazmat transport network design problem. Lect Notes Comput Sci 6701:327\u2013338","journal-title":"Lect Notes Comput Sci"},{"issue":"2","key":"9751_CR7","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.trc.2008.10.001","volume":"17","author":"L Bianco","year":"2009","unstructured":"Bianco L, Caramia M, Giordani S (2009) A bilevel flow model for hazmat transportation netwokrk design. Transp Res Part C Emerg Technol 17(2):175\u2013196","journal-title":"Transp Res Part C Emerg Technol"},{"issue":"5","key":"9751_CR8","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1287\/opre.46.5.625","volume":"46","author":"E Erkut","year":"1998","unstructured":"Erkut E, Verter V (1998) Modeling of transport risk for hazardous materials. Oper Res 46(5):625\u2013642","journal-title":"Oper Res"},{"key":"9751_CR9","volume-title":"Hazardous materials transportation","author":"E Erkut","year":"2007","unstructured":"Erkut E, Tjandra SA, Verter V (2007) Hazardous materials transportation. Elsevier, Amsterdam"},{"key":"9751_CR10","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/978-3-642-02017-9_10","volume":"5532","author":"BH Zhu","year":"2009","unstructured":"Zhu BH (2009) Approximability and fixed-parameter tractability for the exemplar genomic distance problems. Lect Notes Comput Sci 5532:71\u201380","journal-title":"Lect Notes Comput Sci"},{"key":"9751_CR11","doi-asserted-by":"crossref","first-page":"1154","DOI":"10.1287\/opre.21.5.1154","volume":"21","author":"A Soyster","year":"1973","unstructured":"Soyster A (1973) Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper Res 21:1154\u20131157","journal-title":"Oper Res"},{"key":"9751_CR12","doi-asserted-by":"crossref","DOI":"10.1515\/9781400831050","volume-title":"Robust optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal A, El Ghaoui L, Nemirovski AS (2009) Robust optimization. Princeton University Press, Princeton"},{"issue":"1\u20133","key":"9751_CR13","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","volume":"98","author":"D Bertsimas","year":"2003","unstructured":"Bertsimas D, Sim M (2003) Robust discrete optimization and network flows. Math Program Ser B 98(1\u20133):49\u201371","journal-title":"Math Program Ser B"},{"issue":"1","key":"9751_CR14","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas D, Sim M (2004) The price of robustness. Oper Res 52(1):35\u201353","journal-title":"Oper Res"},{"key":"9751_CR15","unstructured":"Karasan OE, Pinar MC, Yaman H (2001) The robust shortest path problem with interval data[R]. Technical report, Bilkent University"},{"key":"9751_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2620-6","volume-title":"Robust discrete optimization and its applications","author":"P Kouvelis","year":"1997","unstructured":"Kouvelis P, Yu G (1997) Robust discrete optimization and its applications. Kluwer Academic Publishers, Boston"},{"key":"9751_CR17","first-page":"71","volume":"7","author":"V Gabrel","year":"2007","unstructured":"Gabrel V, Murat C (2007) Robust shortest path problems. Ann du LAMSADE 7:71\u201393","journal-title":"Ann du LAMSADE"},{"key":"9751_CR18","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1016\/S0377-2217(03)00373-4","volume":"158","author":"P Zielinski","year":"2004","unstructured":"Zielinski P (2004) The computational complexity of the relative robust shortest path problem with interval data. Eur J Oper Res 158:570\u2013576","journal-title":"Eur J Oper Res"},{"key":"9751_CR19","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0166-218X(03)00462-1","volume":"138","author":"I Averbakh","year":"2004","unstructured":"Averbakh I, Lebedev V (2004) Interval data minmax regret network optimizationproblems. Discret Appl Math 138:289\u2013301","journal-title":"Discret Appl Math"},{"issue":"2","key":"9751_CR20","first-page":"125","volume":"42","author":"U Wen","year":"1991","unstructured":"Wen U, Hsu S (1991) Linear bi-Level programming problems - a review. J Oper Res Soc 42(2):125\u2013133","journal-title":"J Oper Res Soc"},{"issue":"1","key":"9751_CR21","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s10479-007-0176-2","volume":"153","author":"B Colson","year":"2007","unstructured":"Colson B, Marcotte P, Savard G (2007) An overview of bilevel optimization. Ann Oper Res 153(1):235\u2013256","journal-title":"Ann Oper Res"},{"key":"9751_CR22","doi-asserted-by":"crossref","first-page":"1667","DOI":"10.1016\/S0305-0548(03)00114-X","volume":"31","author":"R Montemanni","year":"2004","unstructured":"Montemanni R, Gambardella LM (2004) An exact algorithm for the robust shortest path problem with interval data. Comput Oper Res 31:1667\u20131680","journal-title":"Comput Oper Res"},{"issue":"4","key":"9751_CR23","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s10288-005-0066-x","volume":"3","author":"R Montemanni","year":"2005","unstructured":"Montemanni R, Gambardella LM (2005) The robust path problem with interval data via benders decomposition. Q J Oper Res 3(4):315\u2013328","journal-title":"Q J Oper Res"},{"key":"9751_CR24","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/j.orl.2003.08.002","volume":"32","author":"R Montemanni","year":"2004","unstructured":"Montemanni R, Gambardella LM, Donati AV (2004) A branch and bound algorithm for the robust shortest path problem with interval data. Oper Res Lett 32:225\u2013232","journal-title":"Oper Res Lett"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9751-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9751-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9751-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:23Z","timestamp":1559262203000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9751-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,13]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["9751"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9751-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,13]]}}}