{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,10]],"date-time":"2024-08-10T04:37:22Z","timestamp":1723264642211},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,11,28]],"date-time":"2007-11-28T00:00:00Z","timestamp":1196208000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1007\/s00224-007-9096-4","type":"journal-article","created":{"date-parts":[[2007,11,27]],"date-time":"2007-11-27T17:18:26Z","timestamp":1196183906000},"page":"162-186","source":"Crossref","is-referenced-by-count":52,"title":["Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-Linear Objectives with Applications"],"prefix":"10.1007","volume":"45","author":[{"given":"George","family":"Tsaggouris","sequence":"first","affiliation":[]},{"given":"Christos","family":"Zaroliagis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,11,28]]},"reference":[{"key":"9096_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1007\/11908678","volume-title":"Algorithms and Computation, ISAAC 2005","author":"H. Ackermann","year":"2006","unstructured":"Ackermann, H., Newman, A., R\u00f6glin, H., V\u00f6cking, B.: Decision making based on approximate and smoothed Pareto curves. In: Algorithms and Computation, ISAAC 2005. Lecture Notes in Computer Science, vol.\u00a03827, pp.\u00a0675\u2013684. Springer, Berlin (2006). Full version as Tech. Report AIB-2005-23, RWTH Aachen, December (2005)"},{"key":"9096_CR2","volume-title":"Studies in the Economics of Transportation","author":"M. Beckmann","year":"1956","unstructured":"Beckmann, M., McGuire, G., Winsten, C.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)"},{"key":"9096_CR3","unstructured":"Chaudhuri, K., Papadimitriou, C., Rao, S.: Optimum routing with quality of service constraints. Manuscript (2004)"},{"issue":"1","key":"9096_CR4","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF00938761","volume":"46","author":"H. Corley","year":"1985","unstructured":"Corley, H., Moon, I.: Shortest paths in networks with vector weights. J. Optim. Theory Appl. 46(1), 79\u201386 (1985)","journal-title":"J. Optim. Theory Appl."},{"key":"9096_CR5","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1002\/net.3230120105","volume":"12","author":"S. Dafermos","year":"1982","unstructured":"Dafermos, S.: The general multimodal network equilibrium problem with elastic demands. Networks 12, 57\u201372 (1982)","journal-title":"Networks"},{"issue":"1","key":"9096_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/310701.310710","volume":"24","author":"A. Datta","year":"1999","unstructured":"Datta, A., Vandermeer, D., Celik, A., Kumar, V.: Broadcast protocols to support efficient retrieval from databases by mobile users. ACM Trans. Database Syst. 24(1), 1\u201379 (1999)","journal-title":"ACM Trans. Database Syst."},{"key":"9096_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-22199-0","volume-title":"Multicriteria Optimization","author":"M. Ehrgott","year":"2000","unstructured":"Ehrgott, M.: Multicriteria Optimization. Springer, Berlin (2000)"},{"key":"9096_CR8","volume-title":"Multiple Criteria Optimization\u2014State of the Art Annotated Bibliographic Surveys","year":"2002","unstructured":"Ehrgott, M., Gandibleux, X. (eds.): Multiple Criteria Optimization\u2014State of the Art Annotated Bibliographic Surveys. Kluwer Academic, Boston (2002)"},{"key":"9096_CR9","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0020-0190(02)00205-3","volume":"83","author":"F. Ergun","year":"2002","unstructured":"Ergun, F., Sinha, R., Zhang, L.: An improved FPTAS for restricted shortest path. Inf. Process. Lett. 83, 287\u2013291 (2002)","journal-title":"Inf. Process. Lett."},{"key":"9096_CR10","volume-title":"Multiple Criteria Decision Analysis\u2014State of the Art Surveys","year":"2005","unstructured":"Figueira, J., Greco, S., Ehrgott, M. (eds.): Multiple Criteria Decision Analysis\u2014State of the Art Surveys. Springer, Boston (2005)"},{"issue":"4","key":"9096_CR11","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1137\/S0895480199355754","volume":"13","author":"L.K. Fleischer","year":"2000","unstructured":"Fleischer, L.K.: Approximating fractional multicommodity flows independent of the number of commodities. SIAM J. Discrete Math. 13(4), 505\u2013520 (2000)","journal-title":"SIAM J. Discrete Math."},{"key":"9096_CR12","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1287\/trsc.8.4.321","volume":"8","author":"M. Florian","year":"1974","unstructured":"Florian, M., Nguyen, S.: A method for computing network equilibrium with elastic demands. Transp. Sci. 8, 321\u2013332 (1974)","journal-title":"Transp. Sci."},{"issue":"4","key":"9096_CR13","doi-asserted-by":"crossref","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. Transp. Sci. 31(4), 337\u2013348 (1997)","journal-title":"Transp. Sci."},{"key":"9096_CR14","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1023\/A:1009621108971","volume":"6","author":"S. Gabriel","year":"2000","unstructured":"Gabriel, S., Bernstein, D.: Nonadditive shortest paths: subproblems in multi-agent competitive network models. Comput. Math. Organ. Theory 6, 29\u201345 (2000)","journal-title":"Comput. Math. Organ. Theory"},{"key":"9096_CR15","doi-asserted-by":"crossref","unstructured":"Garg, N., K\u00f6nemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In: Proc. 39th IEEE Symposium on Foundations of Computer Science, FOCS\u201998, pp.\u00a0300\u2013309. IEEE CS Press (1998)","DOI":"10.1109\/SFCS.1998.743463"},{"key":"9096_CR16","unstructured":"Garg, N., K\u00f6nemann, J.: Personal communication (2005)"},{"key":"9096_CR17","unstructured":"Goel, A., Ramakrishnan, K.G., Kataria, D., Logothetis, D.: Efficient computation of delay-sensitive routes from one source to all destinations. In: Proc. IEEE Conf. Comput. Commun. INFOCOM (2001)"},{"key":"9096_CR18","series-title":"Lecture Notes in Economics and Mathematical Systems","first-page":"109","volume-title":"Theory and Applications","author":"P. Hansen","year":"1979","unstructured":"Hansen, P.: Bicriterion Path Problems. In: Theory and Applications. Proc. 3rd Conf. Multiple Criteria Decision Making. Lecture Notes in Economics and Mathematical Systems, vol.\u00a0117, pp.\u00a0109\u2013127. Springer, Berlin (1979)"},{"key":"9096_CR19","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"R. Hassin","year":"1992","unstructured":"Hassin, R.: Approximation schemes for the restricted shortest path problem. Math. Oper. Res. 17, 36\u201342 (1992)","journal-title":"Math. Oper. Res."},{"key":"9096_CR20","unstructured":"Hensen, D., Truong, T.: Valuation of travel times savings. J. Transp. Econ. Policy 237\u2013260 (1985)"},{"key":"9096_CR21","unstructured":"Korkmaz, T., Kruz, M.: Multiconstrained optimal path selection. In: Proc. IEEE Conf. Comput. Commun. INFOCOM, pp.\u00a0834\u2013843 (2001)"},{"key":"9096_CR22","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0167-6377(01)00069-4","volume":"28","author":"D.H. Lorenz","year":"2001","unstructured":"Lorenz, D.H., Raz, D.: A simple efficient approximation scheme for the restricted shortest path problem. Oper. Res. Lett. 28, 213\u2013219 (2001)","journal-title":"Oper. Res. Lett."},{"key":"9096_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/978-3-540-45190-7_3","volume-title":"Quality of Future Internet Services","author":"P. Mieghem Van","year":"2003","unstructured":"Van Mieghem, P., Kuipers, F.A., Korkmaz, T., Krunz, M., Curado, M., Monteiro, E., Masip-Bruin, X., Sole-Pareta, J., Sanchez-Lopez, S.: Quality of service routing. In: Quality of Future Internet Services. Lecture Notes in Computer Science, vol.\u00a02856, pp.\u00a080\u2013117. Springer, Berlin (2003)"},{"key":"9096_CR24","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: Proc. 41st Symp. on Foundations of Computer Science, FOCS, pp.\u00a086\u201392 (2000)","DOI":"10.1109\/SFCS.2000.892068"},{"key":"9096_CR25","unstructured":"PIN project (Projekt Integrierte Netzoptimierung): Deutsche Bahn AG (2000)"},{"key":"9096_CR26","unstructured":"Scott, K., Bernstein, D.: Solving a best path problem when the value of time function is nonlinear. Preprint 980976 of the Annual Meeting of the Transportation Research Board (1997)"},{"key":"9096_CR27","unstructured":"Tsaggouris, G., Zaroliagis, C.: Improved FPTAS for multiobjective shortest paths with applications. CTI Techn. Report TR-2005\/07\/03, July (2005)"},{"key":"9096_CR28","unstructured":"Tsaggouris, G., Zaroliagis, C.: QoS-aware multicommodity flows and transportation planning. In: Proc. 6th Workshop on Algorithmic Methods and Models for Optimization of Railways, ATMOS (2006)"},{"key":"9096_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/11940128_40","volume-title":"Algorithms and Computation, ISAAC 2006","author":"G. Tsaggouris","year":"2006","unstructured":"Tsaggouris, G., Zaroliagis, C.: Multiobjective optimization: Improved FPTAS for shortest paths and non-linear objectives with applications. In: Algorithms and Computation, ISAAC 2006. Lecture Notes in Computer Science, vol.\u00a04288, pp.\u00a0389\u2013398. Springer, Berlin (2006)"},{"key":"9096_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1007\/978-3-540-27836-8_99","volume-title":"Automata, Languages, and Programming, ICALP 2004","author":"S. Vassilvitskii","year":"2004","unstructured":"Vassilvitskii, S., Yannakakis, M.: Efficiently computing succinct trade-off curves. In: Automata, Languages, and Programming, ICALP 2004. Lecture Notes in Computer Science, vol.\u00a03142, pp.\u00a01201\u20131213. Springer, Berlin (2004)"},{"key":"9096_CR31","unstructured":"Wagner, F.: Challenging optimization problems at deutsche bahn. AMORE Workshop (invited talk) (1999)"},{"key":"9096_CR32","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/opre.35.1.70","volume":"35","author":"A. Warburton","year":"1987","unstructured":"Warburton, A.: Approximation of Pareto optima in multiple-objective shortest path problems. Oper. Res. 35, 70\u201379 (1987)","journal-title":"Oper. Res."},{"key":"9096_CR33","doi-asserted-by":"crossref","unstructured":"Young, N.: Sequential and parallel algorithms for mixed packing and covering. In: Proc. 42nd IEEE Symp. on Foundations of Computer Science, FOCS, pp. 538\u2013546 (2001)","DOI":"10.1109\/SFCS.2001.959930"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9096-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-007-9096-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9096-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:51:35Z","timestamp":1558698695000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-007-9096-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,28]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["9096"],"URL":"https:\/\/doi.org\/10.1007\/s00224-007-9096-4","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,28]]}}}