{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T13:31:18Z","timestamp":1768397478990,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540856450","type":"print"},{"value":"9783540856467","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85646-7_7","type":"book-chapter","created":{"date-parts":[[2009,1,5]],"date-time":"2009-01-05T10:24:07Z","timestamp":1231151047000},"page":"69-77","source":"Crossref","is-referenced-by-count":23,"title":["Clusters of Non-dominated Solutions in Multiobjective Combinatorial Optimization: An Experimental Analysis"],"prefix":"10.1007","author":[{"given":"Lu\u00eds","family":"Paquete","sequence":"first","affiliation":[]},{"given":"Thomas","family":"St\u00fctzle","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"12","key":"7_CR1_7","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1016\/S0305-0548(96)00026-3","volume":"23","author":"K Andersen","year":"1996","unstructured":"Andersen K, J\u00f6rnsten K, Lind M (1996) On bicriterion minimal spanning trees: an approximation. Comput Oper Res 23(12):1171\u20131182","journal-title":"Comput Oper Res"},{"key":"7_CR2_7","volume-title":"M\u00e9taheuristiques paralleles hybrides: Application au probleme d'affectation quadratique","author":"V Bachelet","year":"1999","unstructured":"Bachelet V (1999) M\u00e9taheuristiques paralleles hybrides: Application au probleme d'affectation quadratique. Dissertation, Universit\u00e9 des Sciences et Technologies de Lille, France"},{"key":"7_CR3_7","first-page":"129","volume-title":"Essays and surveys in metaheuristics","author":"PC Borges","year":"2000","unstructured":"Borges PC, Hansen MP (2000) A study of global convexity for a multiple objective travelling salesman problem. In: Ribeiro CC, Hansen P (eds) Essays and surveys in metaheuristics. Kluwer, Dorderecht, pp 129\u2013150"},{"key":"7_CR4_7","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1145\/267521.267531","volume-title":"Proceedings of the first annual international conference on computational molecular biology","author":"A Caprara","year":"1997","unstructured":"Caprara A (1997) Sorting by reversals is difficult. In: Proceedings of the first annual international conference on computational molecular biology. ACM, New York, NY, pp 75\u201383"},{"key":"7_CR5_7","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 (1997) Connectedness of efficient solutions in multi criteria combinatorial optimization. Eur J Oper Res 97:159\u2013166","journal-title":"Eur J Oper Res"},{"key":"7_CR6_7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF02032304","volume":"52","author":"HV Hamacher","year":"1994","unstructured":"Hamacher HV, Ruhe G (1994) On spanning tree problems with multiple objectives. Ann Oper Res 52:209\u2013230","journal-title":"Ann Oper Res"},{"key":"7_CR7_7","first-page":"215","volume-title":"Local search in combinatorial optimization","author":"DS Johnson","year":"1997","unstructured":"Johnson DS, McGeoch LA (1997) The travelling salesman problem: a case study in local optimization. In: Aarts EHL, Lenstra JK (eds) Local search in combinatorial optimization. Wiley, Chichester, UK, pp 215\u2013310"},{"key":"7_CR8_7","first-page":"271","volume-title":"Soft computing systems: design, management and applications","author":"J Knowles","year":"2002","unstructured":"Knowles J, Corne D (2002) Towards landscape analyses to inform the design of a hybrid local search for the multiobjective quadratic assignment problem. In: Abraham A, Ruiz del Solar J, Koppen M (eds) Soft computing systems: design, management and applications. IOS, Amsterdam, The Netherlands, pp 271\u2013279"},{"issue":"1","key":"7_CR9_7","first-page":"23","volume":"26","author":"H Morita","year":"2001","unstructured":"Morita H, Gandibleux X, Katoh N (2001) Experimental feedback on biobjective permutation scheduling problems solved with a population heuristic. Found Comput Decision Sci 26(1):23\u201350","journal-title":"Found Comput Decision Sci"},{"key":"7_CR10_7","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0377-2217(91)90094-C","volume":"53","author":"J Mote","year":"1991","unstructured":"Mote J, Murthy I, Olson DL (1991) A parametric approach to solving bicriterion shortest path problem. Eur J Oper Res 53:81\u201392","journal-title":"Eur J Oper Res"},{"key":"7_CR11_7","volume-title":"Stochastic local search algorithms for multiobjective combinatorial optimization: methods and analysis","author":"L Paquete","year":"2005","unstructured":"Paquete L (2005) Stochastic local search algorithms for multiobjective combinatorial optimization: methods and analysis. Dissertation, FB Informatik, TU Darmstadt, Germany"},{"key":"7_CR12_7","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/3-540-36970-8_34","volume-title":"Evolutionary multi-criterion optimization (EMO 2003)","author":"L Paquete","year":"2003","unstructured":"Paquete L, St\u00fctzle T (2003) A two-phase local search for the biobjective traveling salesman problem. In: Fonseca CM et al. (eds) Evolutionary multi-criterion optimization (EMO 2003), vol 2632, Lecture Notes in Computer Science. Springer, Berlin, Germany, pp 479\u2013493"},{"issue":"10","key":"7_CR13_7","doi-asserted-by":"publisher","first-page":"3143","DOI":"10.1016\/j.cor.2005.11.022","volume":"34","author":"T Schiavinotto","year":"2007","unstructured":"Schiavinotto T, St\u00fctzle T (2007) A review of metrics on permutations for search space analysis. Comput Oper Res 34(10):3143\u20133153","journal-title":"Comput Oper Res"},{"key":"7_CR14_7","first-page":"222","volume-title":"Recent advances and historical development of vector optimization","author":"P Serafini","year":"1986","unstructured":"Serafini P (1986) Some considerations about computational complexity for multiobjective combinatorial problems. In: Jahn J, Krabs W (eds) Recent advances and historical development of vector optimization, vol 294, Lecture Notes in Economics and Mathematical Systems. Springer, Berlin, Germany, pp 222\u2013231"}],"container-title":["Lecture Notes in Economics and Mathematical Systems","Multiobjective Programming and Goal Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85646-7_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T06:35:09Z","timestamp":1684823709000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85646-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540856450","9783540856467"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85646-7_7","relation":{},"ISSN":["0075-8442"],"issn-type":[{"value":"0075-8442","type":"print"}],"subject":[]}}