{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:52:04Z","timestamp":1725605524608},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642215261"},{"type":"electronic","value":"9783642215278"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21527-8_25","type":"book-chapter","created":{"date-parts":[[2011,9,8]],"date-time":"2011-09-08T11:01:16Z","timestamp":1315479676000},"page":"196-209","source":"Crossref","is-referenced-by-count":0,"title":["The Spatially Equitable Multicommodity Capacitated Network Flow Problem"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Dell\u2019Olmo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonino","family":"Sgalambro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"25_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0377-2217(96)00142-7","volume":"101","author":"R.K. Ahuja","year":"1997","unstructured":"Ahuja, R.K.: The balanced linear programming problem. European Journal of Operational Research\u00a0101(1), 29\u201338 (1997)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"25_CR2","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/S0377-2217(99)00214-3","volume":"121","author":"V. Akgun","year":"2000","unstructured":"Akgun, V., Erkut, E., Batta, R.: On finding dissimilar paths. European Journal of Operational Research\u00a0121(2), 232\u2013246 (2000)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"25_CR3","doi-asserted-by":"publisher","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.: A bilevel flow model for hazmat transportation network design. Transportation Research Part C: Emerging Technologies\u00a017(2), 175\u2013196 (2009)","journal-title":"Transportation Research Part C: Emerging Technologies"},{"issue":"5","key":"25_CR4","doi-asserted-by":"publisher","first-page":"1304","DOI":"10.1016\/j.cor.2005.06.003","volume":"34","author":"P. Carotenuto","year":"2007","unstructured":"Carotenuto, P., Giordani, S., Ricciardelli, S.: Finding minimum and equitable risk routes for hazmat shipments. Computers & Operations Research\u00a034(5), 1304\u20131327 (2007)","journal-title":"Computers & Operations Research"},{"issue":"1","key":"25_CR5","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ejor.2003.10.033","volume":"162","author":"P. Dell\u2019Olmo","year":"2005","unstructured":"Dell\u2019Olmo, P., Gentili, M., Scozzari, A.: On finding dissimilar pareto-optimal paths. European Journal of Operational Research\u00a0162(1), 70\u201382 (2005)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"25_CR6","doi-asserted-by":"publisher","first-page":"1404","DOI":"10.1016\/j.ejor.2005.09.033","volume":"176","author":"H.W. Hamacher","year":"2007","unstructured":"Hamacher, H.W., Pedersen, C.R., Ruzika, S.: Multiple objective minimum cost flow problems: A review. European Journal of Operational Research\u00a0176(3), 1404\u20131422 (2007)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"25_CR7","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1287\/trsc.1080.0236","volume":"43","author":"P. Marcotte","year":"2009","unstructured":"Marcotte, P., Mercier, A., Savard, G., Verter, V.: Toll policies for mitigating hazardous materials transport risk. Transportation Science\u00a043(2), 228\u2013243 (2009)","journal-title":"Transportation Science"},{"issue":"1-3","key":"25_CR8","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0166-218X(97)88001-8","volume":"81","author":"M.G. Scutell\u00e0","year":"1998","unstructured":"Scutell\u00e0, M.G.: A strongly polynomial algorithm for the uniform balanced network flow problem. Discrete Applied Mathematics\u00a081(1-3), 123\u2013131 (1998)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Network Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21527-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,2]],"date-time":"2019-04-02T09:43:41Z","timestamp":1554198221000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21527-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642215261","9783642215278"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21527-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}