{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:34:25Z","timestamp":1759847665441},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540294986"},{"type":"electronic","value":"9783540322450"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11571155_5","type":"book-chapter","created":{"date-parts":[[2005,10,31]],"date-time":"2005-10-31T07:32:31Z","timestamp":1130743951000},"page":"45-47","source":"Crossref","is-referenced-by-count":2,"title":["Recent Advances in Multiobjective Optimization"],"prefix":"10.1007","author":[{"given":"Christos","family":"Zaroliagis","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","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, Heidelberg (2000)"},{"volume-title":"Multiple Criteria Optimization \u2013 state of the art annotated bibliographic surveys","year":"2002","key":"5_CR2","unstructured":"Ehrgott, M., Gandibleux, X. (eds.): Multiple Criteria Optimization \u2013 state of the art annotated bibliographic surveys. Kluwer Academic Publishers, Boston (2002)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Etzioni, O., Hanks, S., Jiang, T., Karp, R., Madari, O., Waarts, O.: Efficient Information Gathering on the Internet. In: Proc.\u00a037th IEEE Symp.\u00a0on Foundations of Computer Science \u2013 FOCS 1996, pp. 234\u2013243 (1996)","DOI":"10.1109\/SFCS.1996.548482"},{"key":"5_CR4","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":"5_CR5","series-title":"LNEMS","first-page":"109","volume-title":"Proc.\u00a03rd Conf.\u00a0Multiple Criteria Decision Making \u2013 Theory and Applications","author":"P. Hansen","year":"1979","unstructured":"Hansen, P.: Bicriterion Path Problems. In: Proc.\u00a03rd Conf.\u00a0Multiple Criteria Decision Making \u2013 Theory and Applications. LNEMS, vol.\u00a0117, pp. 109\u2013127. Springer, Heidelberg (1979)"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1006\/jagm.1998.0930","volume":"28","author":"M. Marathe","year":"1998","unstructured":"Marathe, M., Ravi, R., Sundaram, R., Ravi, S.S., Rosenkrantz, D., Hunt, H.B.: Bicriteria Network Design Problems. Journal of Algorithms\u00a028, 142\u2013171 (1998)","journal-title":"Journal of Algorithms"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C., Yannakakis, M.: On the Approximability of Trade-offs and Optimal Access of Web Sources. In: Proc.\u00a041st IEEE Symp.\u00a0on Foundations of Computer Science \u2013 FOCS 2000, pp. 86\u201392 (2000)","DOI":"10.1109\/SFCS.2000.892068"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Ravi, R., Marathe, M., Ravi, S.S., Rosenkrantz, D., Hunt, H.B.: Many Birds with One Stone: Multi-objective Approximation Algorithms. In: Proc.\u00a025th ACM Symp.\u00a0on Theory of Computing \u2013 STOC 1993, pp. 438\u2013447 (1993)","DOI":"10.1145\/167088.167209"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1007\/978-3-540-30140-0_72","volume-title":"Algorithms \u2013 ESA 2004","author":"G. Tsaggouris","year":"2004","unstructured":"Tsaggouris, G., Zaroliagis, C.: Non-Additive Shortest Paths. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol.\u00a03221, pp. 822\u2013834. Springer, Heidelberg (2004)"},{"key":"5_CR10","unstructured":"Tsaggouris, G., Zaroliagis, C.: Improved FPTAS for Multiobjective Shortest Paths with Applications. CTI Technical Report TR 2005\/07\/03 (July 2005)"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1007\/978-3-540-27836-8_99","volume-title":"Automata, Languages and Programming","author":"S. Vassilvitskii","year":"2004","unstructured":"Vassilvitskii, S., Yannakakis, M.: Efficiently Computing Succinct Trade-off Curves. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 1201\u20131213. Springer, Heidelberg (2004)"},{"key":"5_CR12","doi-asserted-by":"publisher","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. Operations Research\u00a035, 70\u201379 (1987)","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Stochastic Algorithms: Foundations and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11571155_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:55:36Z","timestamp":1605642936000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11571155_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540294986","9783540322450"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11571155_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}