{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T04:44:27Z","timestamp":1768884267021,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642237157","type":"print"},{"value":"9783642237164","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-23716-4_7","type":"book-chapter","created":{"date-parts":[[2011,8,25]],"date-time":"2011-08-25T06:46:59Z","timestamp":1314254819000},"page":"48-63","source":"Crossref","is-referenced-by-count":7,"title":["Elementary Landscape Decomposition of the Test Suite Minimization Problem"],"prefix":"10.1007","author":[{"given":"Francisco","family":"Chicano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Javier","family":"Ferrer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrique","family":"Alba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Chicano, F., Whitley, L.D., Alba, E.: A methodology to find the elementary landscape decomposition of combinatorial optimization problems. Evolutionary Computation (in Press) doi: 10.1162\/EVCO_a_00039","DOI":"10.1162\/EVCO_a_00039"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10664-005-3861-2","volume":"10","author":"H. Do","year":"2005","unstructured":"Do, H., Elbaum, S., Rothermel, G.: Supporting controlled experimentation with testing techniques: An infrastructure and its potential impact. Empirical Softw. Engg.\u00a010, 405\u2013435 (2005), http:\/\/portal.acm.org\/citation.cfm?id=1089922.1089928","journal-title":"Empirical Softw. Engg."},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/0-387-23394-6_5","volume-title":"Recent Advances in Applied Probability","author":"P. Feinsilver","year":"2005","unstructured":"Feinsilver, P., Kocik, J.: Krawtchouk polynomials and krawtchouk matrices. In: Baeza-Yates, R., Glaz, J., Gzyl, H. (eds.) Recent Advances in Applied Probability, pp. 115\u2013141. Springer, US (2005)"},{"key":"7_CR4","first-page":"25","volume-title":"Foundations of Genetic Algorithms","author":"W.B. Langdon","year":"2011","unstructured":"Langdon, W.B.: Elementary bit string mutation landscapes. In: Beyer, H.-G., Langdon, W.B. (eds.) Foundations of Genetic Algorithms, January 5-9, 2011, pp. 25\u201341. ACM Press, Schwarzenberg (2011)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Lu, G., Bahsoon, R., Yao, X.: Applying elementary landscape analysis to search-based software engineering. In: Proceedings of the 2nd International Symposium on Search Based Software Engineering (2010)","DOI":"10.1109\/SSBSE.2010.10"},{"key":"7_CR6","first-page":"392","volume-title":"Proceedings of AAAI","author":"S. Rana","year":"1998","unstructured":"Rana, S., Heckendorn, R.B., Whitley, D.: A tractable walsh analysis of SAT and its implications for genetic algorithms. In: Proceedings of AAAI, pp. 392\u2013397. AAAI Press, Menlo Park (1998)"},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1137\/S0036144501395952","volume":"44","author":"C.M. Reidys","year":"2002","unstructured":"Reidys, C.M., Stadler, P.F.: Combinatorial landscapes. SIAM Review\u00a044(1), 3\u201354 (2002)","journal-title":"SIAM Review"},{"key":"7_CR8","first-page":"77","volume-title":"Complex Systems and Binary Networks","author":"P.F. Stadler","year":"1995","unstructured":"Stadler, P.F.: Toward a theory of landscapes. In: L\u00f3pez-Pe\u00f1a, R., Capovilla, R., Garc\u00eda-Pelayo, R., Waelbroeck, H., Zertruche, F. (eds.) Complex Systems and Binary Networks, pp. 77\u2013163. Springer, Heidelberg (1995)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Sutton, A.M., Howe, A.E., Whitley, L.D.: Directed plateau search for MAX-k-SAT. In: Proceedings of SoCS, Atlanta, GA, USA (July 2010)","DOI":"10.1609\/socs.v1i1.18168"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Sutton, A.M., Whitley, L.D., Howe, A.E.: Computing the moments of k-bounded pseudo-boolean functions over Hamming spheres of arbitrary radius in polynomial time. Theoretical Computer Science (in press) doi:10.1016\/j.tcs.2011.02.006","DOI":"10.1016\/j.tcs.2011.02.006"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1145\/1569901.1569952","volume-title":"Proceedings of GECCO","author":"A.M. Sutton","year":"2009","unstructured":"Sutton, A.M., Whitley, L.D., Howe, A.E.: A polynomial time computation of the exact correlation structure of k-satisfiability landscapes. In: Proceedings of GECCO, pp. 365\u2013372. ACM, New York (2009)"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1145\/1389095.1389208","volume-title":"Proceedings of GECCO","author":"D. Whitley","year":"2008","unstructured":"Whitley, D., Sutton, A.M., Howe, A.E.: Understanding elementary landscapes. In: Proceedings of GECCO, pp. 585\u2013592. ACM, New York (2008)"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1145\/1273463.1273483","volume-title":"Proceedings of the 2007 International Symposium on Software Testing and Analysis (ISSTA 2007)","author":"S. Yoo","year":"2007","unstructured":"Yoo, S., Harman, M.: Pareto efficient multi-objective test case selection. In: Proceedings of the 2007 International Symposium on Software Testing and Analysis (ISSTA 2007), July 9-12, 2007, pp. 140\u2013150. ACM, London (2007)"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Yoo, S., Harman, M.: Regression testing minimisation, selection and prioritisation: A survey. Journal of Software Testing, Verification and Reliability (2010)","DOI":"10.1002\/stvr.430"}],"container-title":["Lecture Notes in Computer Science","Search Based Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23716-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T00:10:09Z","timestamp":1686269409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23716-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237157","9783642237164"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23716-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}