{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:58:16Z","timestamp":1725566296218},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230250"},{"type":"electronic","value":"9783540301400"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30140-0_72","type":"book-chapter","created":{"date-parts":[[2010,9,19]],"date-time":"2010-09-19T01:31:13Z","timestamp":1284859873000},"page":"822-834","source":"Crossref","is-referenced-by-count":15,"title":["Non-additive Shortest Paths"],"prefix":"10.1007","author":[{"given":"George","family":"Tsaggouris","sequence":"first","affiliation":[]},{"given":"Christos","family":"Zaroliagis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"72_CR1","volume-title":"Network Flows","author":"R. Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.: Network Flows. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"72_CR2","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/net.3230190402","volume":"19","author":"J. Beasley","year":"1989","unstructured":"Beasley, J., Christofides, N.: An Algorithm for the Resource Constrained Shortest Path Problem. Networks\u00a019, 379\u2013394 (1989)","journal-title":"Networks"},{"key":"72_CR3","volume-title":"Introduction to Approximation Theory","author":"E.W. Cheney","year":"1966","unstructured":"Cheney, E.W.: Introduction to Approximation Theory. McGraw-Hill, New York (1966)"},{"issue":"4","key":"72_CR4","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1287\/trsc.31.4.337","volume":"31","author":"S. Gabriel","year":"1997","unstructured":"Gabriel, S., Bernstein, D.: The Traffic Equilibrium Problem with Nonadditive Path Costs. Transportation Science\u00a031(4), 337\u2013348 (1997)","journal-title":"Transportation Science"},{"key":"72_CR5","unstructured":"Gabriel, S., Bernstein, D.: Nonadditive Shortest Paths: Subproblems in Multi- Agent Competitive Network Models. Comp. & Math. Organiz. Theory\u00a06 (2000)"},{"key":"72_CR6","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1002\/net.3230100403","volume":"10","author":"G. Handler","year":"1980","unstructured":"Handler, G., Zang, I.: A Dual Algorithm for the Constrained Shortest Path Problem. Networks\u00a010, 293\u2013310 (1980)","journal-title":"Networks"},{"key":"72_CR7","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0377-2217(86)90092-5","volume":"25","author":"M. Henig","year":"1985","unstructured":"Henig, M.: The Shortest Path Problem with Two Objective Functions. European Journal of Operational Research\u00a025, 281\u2013291 (1985)","journal-title":"European Journal of Operational Research"},{"key":"72_CR8","unstructured":"Hensen, D., Truong, T.: Valuation of Travel Times Savings. Journal of Transport Economics and Policy, 237\u2013260 (1985)"},{"key":"72_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/3-540-45253-2_30","volume-title":"Algorithms - ESA 2000","author":"K. Mehlhorn","year":"2000","unstructured":"Mehlhorn, K., Ziegelmann, M.: Resource Constrained Shortest Paths. In: Paterson, M. (ed.) ESA 2000. LNCS, vol.\u00a01879, pp. 326\u2013337. Springer, Heidelberg (2000)"},{"key":"72_CR10","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0096-3003(93)90060-R","volume":"54","author":"P. Mirchandani","year":"1993","unstructured":"Mirchandani, P., Wiecek, M.: Routing with Nonlinear Multiattribute Cost Functions. Applied Mathematics and Computation\u00a054, 215\u2013239 (1993)","journal-title":"Applied Mathematics and Computation"},{"key":"72_CR11","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C., Yannakakis, M.: On the Approximability of Trade-offs and Optimal Access of Web Sources. In: Proc. 41st FOCS 2000, pp. 86\u201392 (2000)","DOI":"10.1109\/SFCS.2000.892068"},{"key":"72_CR12","unstructured":"Scott, K., Bernstein, D.: Solving a Best Path Problem when the Value of Time Function is Nonlinear, preprint 980976 of the Transport. Research Board (1997)"},{"key":"72_CR13","doi-asserted-by":"crossref","unstructured":"Tsaggouris, G., Zaroliagis, C.: Non-Additive Shortest Paths, Tech. Report TR-2004\/03\/01, Computer Technology Institute, Patras (March 2004)","DOI":"10.1007\/978-3-540-30140-0_72"},{"issue":"1","key":"72_CR14","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1287\/trsc.32.1.65","volume":"32","author":"F.B. Zhan","year":"1998","unstructured":"Zhan, F.B., Noon, C.E.: Shortest Path Algorithms: An Evaluation using Real Road Networks. Transportation Science\u00a032(1), 65\u201373 (1998)","journal-title":"Transportation Science"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30140-0_72.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:44:44Z","timestamp":1605761084000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30140-0_72"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230250","9783540301400"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30140-0_72","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}