{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T14:25:09Z","timestamp":1768400709433,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642255656","type":"print"},{"value":"9783642255663","type":"electronic"}],"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-25566-3_3","type":"book-chapter","created":{"date-parts":[[2011,11,14]],"date-time":"2011-11-14T09:19:51Z","timestamp":1321262391000},"page":"31-45","source":"Crossref","is-referenced-by-count":1,"title":["On the Effect of Connectedness for Biobjective Multiple and Long Path Problems"],"prefix":"10.1007","author":[{"given":"S\u00e9bastien","family":"Verel","sequence":"first","affiliation":[]},{"given":"Arnaud","family":"Liefooghe","sequence":"additional","affiliation":[]},{"given":"J\u00e9r\u00e9mie","family":"Humeau","sequence":"additional","affiliation":[]},{"given":"Laetitia","family":"Jourdan","sequence":"additional","affiliation":[]},{"given":"Clarisse","family":"Dhaenens","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/3-540-58484-6_259","volume-title":"Parallel Problem Solving from Nature - PPSN III","author":"J. Horn","year":"1994","unstructured":"Horn, J., Goldberg, D., Deb, K.: Long path problems. In: Davidor, Y., M\u00e4nner, R., Schwefel, H.-P. (eds.) PPSN 1994. LNCS, vol.\u00a0866, pp. 149\u2013158. Springer, Heidelberg (1994)"},{"issue":"2","key":"3_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1162\/evco.1996.4.2.195","volume":"4","author":"G. Rudolph","year":"1996","unstructured":"Rudolph, G.: How mutation and selection solve long path problems in polynomial expected time. Evolutionary Computation\u00a04(2), 195\u2013205 (1996)","journal-title":"Evolutionary Computation"},{"key":"3_CR3","unstructured":"Gorski, J., Klamroth, K., Ruzika, S.: Connectedness of efficient solutions in multiple objective combinatorial optimization. Technical Report 102\/2006, University of Kaiserslautern, Department of Mathematics (2006)"},{"issue":"1","key":"3_CR4","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0377-2217(96)00116-6","volume":"97","author":"M. Ehrgott","year":"1997","unstructured":"Ehrgott, M., Klamroth, K.: Connectedness of efficient solutions in multiple criteria combinatorial optimization. European Journal of Operational Research\u00a097(1), 159\u2013166 (1997)","journal-title":"European Journal of Operational Research"},{"key":"3_CR5","series-title":"LNEMS","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-540-85646-7_7","volume-title":"Multiobjective Programming and Goal Programming","author":"L. Paquete","year":"2009","unstructured":"Paquete, L., St\u00fctzle, T.: Clusters of non-dominated solutions in multiobjective combinatorial optimization: An experimental analysis. In: Multiobjective Programming and Goal Programming. LNEMS, vol.\u00a0618, pp. 69\u201377. Springer, Heidelberg (2009)"},{"key":"3_CR6","series-title":"LNEMS","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-17144-4_7","volume-title":"Metaheuristics for Multiobjective Optimisation","author":"L. Paquete","year":"2004","unstructured":"Paquete, L., Chiarandini, M., St\u00fctzle, T.: Pareto local optimum sets in the biobjective traveling salesman problem: An experimental study. In: Metaheuristics for Multiobjective Optimisation. LNEMS, vol.\u00a0535, pp. 177\u2013199. Springer, Heidelberg (2004)"},{"key":"3_CR7","volume-title":"Multicriteria optimization","author":"M. Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria optimization, 2nd edn. Springer, Heidelberg (2005)","edition":"2"},{"issue":"1","key":"3_CR8","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1023\/B:NACO.0000023415.22052.55","volume":"3","author":"M. Laumanns","year":"2004","unstructured":"Laumanns, M., Thiele, L., Zitzler, E.: Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem. Natural Computing: an International Journal\u00a03(1), 37\u201351 (2004)","journal-title":"Natural Computing: an International Journal"},{"issue":"4","key":"3_CR9","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E. Zitzler","year":"1999","unstructured":"Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: A comparative case study and the strength pareto approach. IEEE Transactions on Evolutionary Computation\u00a03(4), 257\u2013271 (1999)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"3_CR10","series-title":"LNEMS","volume-title":"Recent Advances and Historical Development of Vector Optimization","author":"P. Serafini","year":"1986","unstructured":"Serafini, P.: Some considerations about computational complexity for multiobjective combinatorial problems. In: Recent Advances and Historical Development of Vector Optimization. LNEMS, vol.\u00a0294. Springer, Heidelberg (1986)"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BFb0056845","volume-title":"Parallel Problem Solving from Nature - PPSN V","author":"S. Droste","year":"1998","unstructured":"Droste, S., Jansen, T., Wegener, I.: On the optimization of unimodal functions with the (1 + 1) evolutionary algorithm. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol.\u00a01498, pp. 13\u201322. Springer, Heidelberg (1998)"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1145\/1527125.1527137","volume-title":"Tenth Workshop on Foundations of Genetic Algorithms (FOGA 2009)","author":"C. Horoba","year":"2009","unstructured":"Horoba, C., Neumann, F.: Additive approximations of pareto-optimal sets by evolutionary multi-objective algorithms. In: Tenth Workshop on Foundations of Genetic Algorithms (FOGA 2009), pp. 79\u201386. ACM, New York (2009)"},{"issue":"1","key":"3_CR13","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/TEVC.2009.2016569","volume":"14","author":"E. Zitzler","year":"2010","unstructured":"Zitzler, E., Thiele, L., Bader, J.: On set-based multiobjective optimization. IEEE Transactions on Evolutionary Computation\u00a014(1), 58\u201379 (2010)","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25566-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T20:21:25Z","timestamp":1555532485000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25566-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255656","9783642255663"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25566-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}