{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:37:46Z","timestamp":1760647066758,"version":"3.37.3"},"reference-count":71,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,8,30]],"date-time":"2019-08-30T00:00:00Z","timestamp":1567123200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,30]],"date-time":"2019-08-30T00:00:00Z","timestamp":1567123200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61773410"],"award-info":[{"award-number":["61773410"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Empir Software Eng"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s10664-019-09761-2","type":"journal-article","created":{"date-parts":[[2019,8,30]],"date-time":"2019-08-30T02:03:15Z","timestamp":1567130595000},"page":"591-626","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Going deeper with optimal software products selection using many-objective optimization and satisfiability solvers"],"prefix":"10.1007","volume":"25","author":[{"given":"Yi","family":"Xiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaowei","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuren","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zibin","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miqing","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Han","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,30]]},"reference":[{"key":"9761_CR1","doi-asserted-by":"crossref","unstructured":"Balint A, Sch\u00f6ning U (2012) Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break. International Conference on Theory and Applications of Satisfiability Testing, Berlin, pp 16\u201329","DOI":"10.1007\/978-3-642-31612-8_3"},{"key":"9761_CR2","unstructured":"Balint A, Sch\u00f6ning U (2014) ProbSAT and pprobSAT. In: Belov A., Diepold D., Heule M. J., J\u00e4rvisalo M (eds) Proceedings of SAT Competition 2014: Solver and Benchmark Descriptions. Department of Computer Science Series of Publications B and Department of Computer Science, University of Helsinki, Helsinki, vol B-2014-2, p 63"},{"key":"9761_CR3","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.artint.2016.08.007","volume":"241","author":"T Balyo","year":"2016","unstructured":"Balyo T, Biere A, Isera M, Sinza C (2016) SAT Race 2015. Artif Intell 241:45\u201365","journal-title":"Artif Intell"},{"key":"9761_CR4","doi-asserted-by":"publisher","unstructured":"Batory D (2005) Feature models, grammars, and propositional formulas. In: Obbink H., Pohl K. (eds) Proceedings of the 9th International Conference Software Product Lines, SPLC 2005. Springer, Berlin, pp 7\u201320. \nhttps:\/\/doi.org\/10.1007\/11554844_3","DOI":"10.1007\/11554844_3"},{"key":"9761_CR5","doi-asserted-by":"publisher","unstructured":"Berger T, She S, Lotufo R, Wasowski A, Czarnecki K (2010) Variability modeling in the real: a perspective from the operating systems domain. In: Proceedings of the IEEE\/ACM International Conference on Automated Software Engineering, ASE \u201910. ACM, New York, pp 73-82. \nhttps:\/\/doi.org\/10.1145\/1858996.1859010","DOI":"10.1145\/1858996.1859010"},{"key":"9761_CR6","doi-asserted-by":"crossref","unstructured":"Berger T, Lettner D, Rubin J, Gr\u00fcnbacher P, Silva A, Becker M, Chechik M, Czarnecki K (2015) What is a feature?: a qualitative study of features in industrial software product lines. In: Proceedings of the 19th International Conference on Software Product Line (SPLC), pp 16\u201325","DOI":"10.1145\/2791060.2791108"},{"key":"9761_CR7","first-page":"59","volume":"7","author":"DL Berre","year":"2010","unstructured":"Berre DL, Parrain A (2010) The Sat4j library, release 2.2, system description. Journal on Satisfiability. Boolean Model Comput 7:59\u201364","journal-title":"Boolean Model Comput"},{"issue":"3","key":"9761_CR8","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1109\/TEVC.2015.2474158","volume":"20","author":"LCT Bezerra","year":"2016","unstructured":"Bezerra LCT, L\u00f3pez-Ib\u00e1\u00f1ez M, St\u00fctzle T (2016) Automatic component-wise design of multiobjective evolutionary algorithms. IEEE Trans Evol Comput 20(3):403\u2013417. \nhttps:\/\/doi.org\/10.1109\/TEVC.2015.2474158","journal-title":"IEEE Trans Evol Comput"},{"key":"9761_CR9","unstructured":"Biere A (2010) Lingeling, Plingeling, picoSAT and precoSAT at SAT Race 2010. Tech. rep., Institute for Formal Models and Verification, Johannes Kepler University, Altenbergerstr 69, 4040 Linz, Austria"},{"key":"9761_CR10","unstructured":"Biere A (2018) CADICAL, LINGELING, PLINGELING, TREENGELING And YALSAT entering the SAT competition 2018. In: Heule M. JH, J\u00e4rvisalo MJ, Suda M (eds) Proceedings of SAT Competition 2018: Solver and Benchmark Descriptions. Department of Computer Science Series of Publications B and Department of Computer Science, University of Helsinki, Helsinki, vol B-2018-1, pp 13\u201314"},{"key":"9761_CR11","unstructured":"Cai S (2013) Faster implementation for walksat. Tech. rep., Queensland Research Lab, NICTA, Australia"},{"key":"9761_CR12","unstructured":"Chen J (2018a) AbcdSAT and Glucose hack: Various Simplifications and Optimizations for CDCL SAT solvers. In: Heule MJH, J\u00e4rvisalo MJ, Suda M (eds) Proceedings of SAT Competition 2018: Solver and Benchmark Descriptions. Department of Computer Science Series of Publications B and Department of Computer Science, University of Helsinki, Helsinki, vol B-2018-1, pp 10\u201312"},{"key":"9761_CR13","doi-asserted-by":"publisher","unstructured":"Chen J, Nair V, Krishna R, Menzies T (2018b) \u2018Sampling\u2019 as a Baseline Optimizer for Search-based Software Engineering IEEE Transactions on Software Engineering. \nhttps:\/\/doi.org\/10.1109\/TSE.2018.2790925","DOI":"10.1109\/TSE.2018.2790925"},{"key":"9761_CR14","unstructured":"Clements P, Northrop L (2001) Software product lines: practices and patterns. Addison-wesley Longman Publishing Co. Inc"},{"key":"9761_CR15","volume-title":"Evolutionary Algorithms for Solving Multi-objective Problems","author":"CA Coello Coello","year":"2007","unstructured":"Coello Coello CA, Lamont GB, Veldhuizen DAV (2007) Evolutionary Algorithms for Solving Multi-objective Problems, 2nd edn. Springer Science + Business Media, LLC, New York","edition":"2nd edn."},{"key":"9761_CR16","unstructured":"Czarnecki K, Eisenecker U (2000) Generative programming: methods, tools, and applications. Addison-Wesley, Reading"},{"issue":"7","key":"9761_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac J, Garcia S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1(7):3\u201318","journal-title":"Swarm Evol Comput"},{"key":"9761_CR18","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1016\/j.advengsoft.2011.05.014","volume":"42","author":"JJ Durillo","year":"2011","unstructured":"Durillo JJ, Nebro AJ (2011) jMetal: A java framework for multi-objective optimization. Adv Eng Softw 42:760\u2013771","journal-title":"Adv Eng Softw"},{"key":"9761_CR19","doi-asserted-by":"publisher","unstructured":"Dutra R, Laeufer K, Bachrach J, Sen K (2018) Efficient sampling of SAT solutions for testing. In: 2018 IEEE\/ACM 40Th international conference on software engineering (ICSE). IEEE Computer Society, Los Alamitos, pp 549\u2013559. \nhttps:\/\/doi.org\/10.1145\/3180155.3180248","DOI":"10.1145\/3180155.3180248"},{"key":"9761_CR20","unstructured":"E\u00e9n N, S\u00f6rensson N (2003) An Extensible SAT-solver. In: International conference on theory and applications of satisfiability testing. Springer, Berlin, pp 502\u2013518"},{"issue":"4","key":"9761_CR21","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.3758\/BRM.41.4.1149","volume":"41","author":"F Faul","year":"2009","unstructured":"Faul F, Erdfelder E, Buchner A, Lang AG (2009) Statistical power analyses using G*Power 3.1: Tests for correlation and regression analyses. Behav Res Methods 41(4):1149\u20131160. \nhttps:\/\/doi.org\/10.3758\/BRM.41.4.1149","journal-title":"Behav Res Methods"},{"key":"9761_CR22","doi-asserted-by":"publisher","unstructured":"Guo J, Zulkoski E, Olaechea R, Rayside D, Czarnecki K, Apel S, Atlee JM (2014) Scaling exact multi-objective combinatorial optimization by parallelization. In: ACM\/IEEE International conference on automated software engineering, ASE \u201914, Vasteras, Sweden, pp 409\u2013420. \nhttps:\/\/doi.org\/10.1145\/2642937.2642971","DOI":"10.1145\/2642937.2642971"},{"key":"9761_CR23","doi-asserted-by":"publisher","unstructured":"Guo J, Liang JH, Shi K, Yang D, Zhang J, Czarnecki K, Ganesh V, Yu H (2017) SMTIBEA: A hybrid multi-objective optimization algorithm for configuring large constrained software product lines Software & Systems Modeling. \nhttps:\/\/doi.org\/10.1007\/s10270-017-0610-0","DOI":"10.1007\/s10270-017-0610-0"},{"key":"9761_CR24","doi-asserted-by":"publisher","unstructured":"Guo J, Shi K (2018) To preserve or not to preserve invalid solutions in search-based software engineering: a case study in software product lines. In: Proceedings of the 40th International Conference on Software Engineering, ICSE \u201918. ACM, New York, pp 1027\u20131038. \nhttps:\/\/doi.org\/10.1145\/3180155.3180163","DOI":"10.1145\/3180155.3180163"},{"key":"9761_CR25","doi-asserted-by":"publisher","unstructured":"Henard C, Papadakis M, Harman M, Traon YL (2015) Combining multi-objective search and constraint solving for configuring large software product lines. In: The 37th international conference on software engineering, vol 1, pp 517\u2013528. \nhttps:\/\/doi.org\/10.1109\/ICSE.2015.69","DOI":"10.1109\/ICSE.2015.69"},{"key":"9761_CR26","doi-asserted-by":"publisher","unstructured":"Henard C, Papadakis M, Perrouin G, Klein J, Traon YL (2013a) Assessing software product line testing via model-based mutation: an application to similarity testing. In: 2013 IEEE Sixth international conference on software testing, verification and validation workshops, pp 188\u2013197. \nhttps:\/\/doi.org\/10.1109\/ICSTW.2013.30","DOI":"10.1109\/ICSTW.2013.30"},{"key":"9761_CR27","doi-asserted-by":"publisher","unstructured":"Henard C, Papadakis M, Perrouin G, Klein J, Traon YL (2013b) Multi-objective test generation for software product lines. In: Proceedings of the 17th International Software Product Line Conference, SPLC \u201913. ACM, New York, pp 62\u201371. \nhttps:\/\/doi.org\/10.1145\/2491627.2491635","DOI":"10.1145\/2491627.2491635"},{"issue":"7","key":"9761_CR28","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1109\/TSE.2014.2327020","volume":"40","author":"C Henard","year":"2014","unstructured":"Henard C, Papadakis M, Perrouin G, Klein J, Heymans P, Le Traon Y (2014) Bypassing the combinatorial explosion: Using similarity to generate and prioritize t-wise test configurations for software product lines. IEEE Trans Softw Eng 40(7):650\u2013670. \nhttps:\/\/doi.org\/10.1109\/TSE.2014.2327020","journal-title":"IEEE Trans Softw Eng"},{"key":"9761_CR29","doi-asserted-by":"publisher","unstructured":"Harman M (2007) The current state and future of search based software engineering. In: Future of software engineering, FOSE \u201907. IEEE Computer Society, Washington, pp 342\u2013357. \nhttps:\/\/doi.org\/10.1109\/FOSE.2007.29","DOI":"10.1109\/FOSE.2007.29"},{"issue":"1","key":"9761_CR30","doi-asserted-by":"publisher","first-page":"11:1","DOI":"10.1145\/2379776.2379787","volume":"45","author":"M Harman","year":"2012","unstructured":"Harman M, Mansouri SA, Zhang Y (2012) Search-based software engineering: trends, techniques and applications. ACM Comput Surv 45(1):11:1\u201311:61. \nhttps:\/\/doi.org\/10.1145\/2379776.2379787","journal-title":"ACM Comput Surv"},{"key":"9761_CR31","doi-asserted-by":"publisher","unstructured":"Harman M, Jia Y, Krinke J, Langdon B, Petke J, Zhang Y (2014) Search based software engineering for software product line engineering: a survey and directions for future work. In: Proceedings of the 18th International Software Product Line Conference - Volume 1, SPLC \u201914. ACM, New York, pp 5\u201318. \nhttps:\/\/doi.org\/10.1145\/2648511.2648513","DOI":"10.1145\/2648511.2648513"},{"issue":"2","key":"9761_CR32","doi-asserted-by":"publisher","first-page":"17:1","DOI":"10.1145\/2897760","volume":"25","author":"RM Hierons","year":"2016","unstructured":"Hierons RM, Li M, Liu X, Segura S, Zheng W (2016) SIP: Optimal Product selection from feature models using Many-Objective evolutionary optimization. ACM Trans Softw Eng Methodol 25(2):17:1\u201317:39. \nhttps:\/\/doi.org\/10.1145\/2897760","journal-title":"ACM Trans Softw Eng Methodol"},{"issue":"5","key":"9761_CR33","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1109\/TEVC.2015.2505784","volume":"20","author":"H Ishibuchi","year":"2016","unstructured":"Ishibuchi H, Masuda H, Nojima Y (2016) Pareto fronts of many-objective degenerate test problems. IEEE Trans Evol Comput 20(5):807\u2013813. \nhttps:\/\/doi.org\/10.1109\/TEVC.2015.2505784","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"9761_CR34","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1109\/TEVC.2016.2587749","volume":"21","author":"H Ishibuchi","year":"2017","unstructured":"Ishibuchi H, Setoguchi Y, Masuda H, Nojima Y (2017) Performance of decomposition-based many-objective algorithms strongly depends on pareto front shapes. IEEE Trans Evol Comput 21(2):169\u2013190. \nhttps:\/\/doi.org\/10.1109\/TEVC.2016.2587749","journal-title":"IEEE Trans Evol Comput"},{"key":"9761_CR35","doi-asserted-by":"crossref","unstructured":"Johansen MF, Haugen \u00d8, Fleurey F (2012) An algorithm for generating t-wise covering arrays from large feature models. In: Proceedings of the 16th International Software Product Line Conference-Volume 1. ACM, pp 46\u201355","DOI":"10.1145\/2362536.2362547"},{"key":"9761_CR36","doi-asserted-by":"crossref","unstructured":"Kang KC, Cohen SG, Hess JA, Novak WE, Peterson AS (1990) Feature-oriented domain analysis (FODA ) feasibility study. Tech. rep., CMU\/SEI-90-TR-21. SEI Georgetown University","DOI":"10.21236\/ADA235785"},{"key":"9761_CR37","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1109\/TEVC.2013.2262178","volume":"18","author":"M Li","year":"2014","unstructured":"Li M, Yang S, Liu X (2014) Shift-based density estimation for pareto-based algorithms in many-objective optimization. IEEE Trans Evol Comput 18:348\u201365","journal-title":"IEEE Trans Evol Comput"},{"key":"9761_CR38","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.artint.2015.06.007","volume":"228","author":"M Li","year":"2015","unstructured":"Li M, Yang S, Liu X (2015a) Bi-goal evolution for many-objective optimization problems. Artif Intell 228:45\u201365","journal-title":"Artif Intell"},{"issue":"1","key":"9761_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2792984","volume":"48","author":"B Li","year":"2015","unstructured":"Li B, Li J, Tang K, Yao X (2015b) Many-objective evolutionary algorithms: A survey. ACM Comput Surv 48(1):1\u201335","journal-title":"ACM Comput Surv"},{"key":"9761_CR40","doi-asserted-by":"publisher","unstructured":"Li M, Chen T, Yao X (2018) A critical review of: \u201da practical guide to select quality indicators for assessing pareto-based search algorithms in search-based software engineering\u201d: Essay on quality indicator selection for sbse. In: Proceedings of the 40th International Conference on Software Engineering: New Ideas and Emerging Results, ICSE-NIER \u201918. ACM, New York, pp 17\u201320. \nhttps:\/\/doi.org\/10.1145\/3183399.3183405","DOI":"10.1145\/3183399.3183405"},{"issue":"2","key":"9761_CR41","doi-asserted-by":"publisher","first-page":"26:1","DOI":"10.1145\/3300148","volume":"52","author":"M Li","year":"2019","unstructured":"Li M, Yao X (2019) Quality evaluation of solution sets in multiobjective optimisation: A survey. ACM Comput Surv 52(2):26:1\u201326:38. \nhttps:\/\/doi.org\/10.1145\/3300148","journal-title":"ACM Comput Surv"},{"key":"9761_CR42","doi-asserted-by":"publisher","unstructured":"Liang JH, Ganesh V, Czarnecki K, Raman V (2015) SAT-Based Analysis of Large Real-world Feature Models is Easy. In: Proceedings of the 19th International Conference on Software Product Line, SPLC \u201915. ACM, New York, pp 91\u2013100. \nhttps:\/\/doi.org\/10.1145\/2791060.2791070","DOI":"10.1145\/2791060.2791070"},{"key":"9761_CR43","doi-asserted-by":"crossref","unstructured":"Lopez-Herrejon RE, Chicano F, Ferrer J, Egyed A, Alba E (2013) Multi-objective optimal test suite computation for software product line pairwise testing. In: IEEE International conference on software maintenance, pp 404\u2013407","DOI":"10.1109\/ICSM.2013.58"},{"issue":"5","key":"9761_CR44","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"JP Marques-Silva","year":"1999","unstructured":"Marques-Silva JP, Sakallah KA (1999) GRASP: A search algorithm for propositional satisfiability. IEEE Trans Comput 48(5):506\u2013521","journal-title":"IEEE Trans Comput"},{"key":"9761_CR45","unstructured":"Mendonca M, Wasowski A, Czarnecki K (2009) SAT-Based Analysis of Feature Models is Easy. In: Proceedings of the 13th International Software Product Line Conference, SPLC \u201909. Carnegie Mellon University, Pittsburgh, pp 231\u2013240"},{"key":"9761_CR46","doi-asserted-by":"crossref","unstructured":"Olaechea R, Rayside D, Guo J, Czarnecki K (2014) Comparison of exact and approximate multi-objective optimization for software product lines. In: The international software product line conference, pp 92\u2013101","DOI":"10.1145\/2648511.2648521"},{"key":"9761_CR47","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1109\/ICST.2010.43","volume":"00","author":"G Perrouin","year":"2010","unstructured":"Perrouin G, Sen S, Baudry JKB, le Traon Y (2010) Automated and Scalable T-wise Test Case Generation Strategies for Software Product Lines. IEEE Sixth Int Conf Softw Test Verif Valid 00:459\u2013468. \nhttps:\/\/doi.org\/10.1109\/ICST.2010.43","journal-title":"IEEE Sixth Int Conf Softw Test Verif Valid"},{"key":"9761_CR48","doi-asserted-by":"crossref","unstructured":"Pohl R, Lauenroth K, Pohl K (2011) A performance comparison of contemporary algorithmic approaches for automated analysis operations on feature models. In: IEEE\/ACM International conference on automated software engineering, pp 313\u2013322","DOI":"10.1109\/ASE.2011.6100068"},{"key":"9761_CR49","unstructured":"Rayside D, Estler HC, Jackson D (2009) The guided improvement algorithm for exact, general-purpose, many-objective combinatorial optimization. Tech. rep., MIT-CSAIL-TR-2009-033 MIT CSAIL"},{"key":"9761_CR50","doi-asserted-by":"crossref","unstructured":"Sayyad AS, Goseva-Popstojanova K, Menzies T, Ammar H (2013a) On parameter tuning in search based software engineering: a replicated empirical study. In: International workshop on replication in empirical software engineering research, pp 84\u201390","DOI":"10.1109\/RESER.2013.6"},{"key":"9761_CR51","doi-asserted-by":"publisher","unstructured":"Sayyad AS, Ingram J, Menzies T, Ammar H (2013b) Scalable product line configuration: a straw to break the camel\u2019s back. In: 2013 28Th IEEE\/ACM international conference on automated software engineering (ASE), pp 465\u2013474. \nhttps:\/\/doi.org\/10.1109\/ASE.2013.6693104","DOI":"10.1109\/ASE.2013.6693104"},{"key":"9761_CR52","doi-asserted-by":"publisher","unstructured":"Sayyad AS, Menzies T, Ammar H (2013c) On the value of user preferences in search-based software engineering: a case study in software product lines. In: 2013 35Th international conference on software engineering (ICSE), pp 492\u2013501. \nhttps:\/\/doi.org\/10.1109\/ICSE.2013.6606595","DOI":"10.1109\/ICSE.2013.6606595"},{"key":"9761_CR53","unstructured":"Selman B, Levesque H, Mitchell D (1992) A new method for solving hard satisfiability problems. In: Proceedings of the Tenth National Conference on Artificial Intelligence, AAAI\u201992. AAAI Press, pp 440\u2013446"},{"key":"9761_CR54","unstructured":"Selman B, Kautz HA, Cohen B (1994) Noise strategies for improving local search. In: Proceedings of the Twelfth National Conference on Artificial Intelligence (Vol. 1), AAAI \u201994. American Association for Artificial Intelligence, Menlo Park, pp 337\u2013343"},{"key":"9761_CR55","doi-asserted-by":"publisher","unstructured":"She S, Lotufo R, Berger T, Wasowski A, Czarnecki K (2011) Reverse engineering feature models. In: Proceedings of the 33rd International Conference on Software Engineering, ICSE \u201911. ACM, New York, pp 461\u2013470. \nhttps:\/\/doi.org\/10.1145\/1985793.1985856","DOI":"10.1145\/1985793.1985856"},{"key":"9761_CR56","unstructured":"Simon L, Audemard G (2009) Predicting learnt clauses quality in modern SAT solver. In: Twenty-first international joint conference on artificial intelligence (IJCAI\u201909). Pasadena, United States"},{"issue":"6","key":"9761_CR57","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/2.294849","volume":"27","author":"M Srinivas","year":"1994","unstructured":"Srinivas M, Patnaik LM (1994) Genetic algorithms: a survey. Computer 27 (6):17\u201326","journal-title":"Computer"},{"key":"9761_CR58","doi-asserted-by":"crossref","unstructured":"Tan TH, Xue Y, Chen M, Sun J, Liu Y, Dong JS (2015) Optimizing selection of competing features via feedback-directed evolutionary algorithms. In: Proceedings of the 2015 International Symposium on Software Testing and Analysis (ISSTA 2015), pp 246\u2013256","DOI":"10.1145\/2771783.2771808"},{"issue":"6","key":"9761_CR59","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1109\/TCYB.2016.2550502","volume":"47","author":"H Wang","year":"2017","unstructured":"Wang H, Jin Y, Yao X (2017) Diversity assessment in many-objective optimization. IEEE Trans Cybern 47(6):1510\u20131522. \nhttps:\/\/doi.org\/10.1109\/TCYB.2016.2550502","journal-title":"IEEE Trans Cybern"},{"issue":"6","key":"9761_CR60","doi-asserted-by":"publisher","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon F (1945) Individual comparisons by ranking methods. Biom Bullet 1 (6):80\u201383","journal-title":"Biom Bullet"},{"issue":"3","key":"9761_CR61","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1007\/s10489-017-0929-9","volume":"47","author":"Y Xiang","year":"2017","unstructured":"Xiang Y, Peng J, Zhou Y, Li M, Chen Z (2017a) An angle based constrained many-objective evolutionary algorithm. Appl Intell 47(3):705\u2013720. \nhttps:\/\/doi.org\/10.1007\/s10489-017-0929-9","journal-title":"Appl Intell"},{"issue":"1","key":"9761_CR62","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1109\/TEVC.2016.2587808","volume":"21","author":"Y Xiang","year":"2017","unstructured":"Xiang Y, Zhou Y, Li M, Chen Z (2017b) A vector angle based evolutionary algorithm for unconstrained many-objective problems. IEEE Trans Evol Comput 21(1):131\u2013152. \nhttps:\/\/doi.org\/10.1109\/TEVC.2016.2587808","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"9761_CR63","doi-asserted-by":"publisher","first-page":"14:1","DOI":"10.1145\/3176644","volume":"26","author":"Y Xiang","year":"2018","unstructured":"Xiang Y, Zhou Y, Zheng Z, Li M (2018) Configuring software product lines by combining Many-Objective optimization and SAT solvers. ACM Trans Softw Eng Methodol 26(4):14:1\u201314:46. \nhttps:\/\/doi.org\/10.1145\/3176644","journal-title":"ACM Trans Softw Eng Methodol"},{"key":"9761_CR64","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.1016\/j.asoc.2016.07.040","volume":"49","author":"Y Xue","year":"2016","unstructured":"Xue Y, Zhong J, Tan TH, Liu Y, Cai W, Chen M, Sun J (2016) IBED: Combining IBEA And DE for optimal feature selection in software product line engineering. Appl Soft Comput 49:1215\u20131231. \nhttps:\/\/doi.org\/10.1016\/j.asoc.2016.07.040","journal-title":"Appl Soft Comput"},{"key":"9761_CR65","doi-asserted-by":"publisher","unstructured":"Xue Y, Li YF (2018) Multi-objective Integer Programming Approaches for Solving Optimal Feature Selection Problem: A New Perspective on Multi-objective Optimization Problems in SBSE. In: Proceedings of the 40th International Conference on Software Engineering, ICSE \u201918. ACM, New York, pp 1231\u20131242. \nhttps:\/\/doi.org\/10.1145\/3180155.3180257","DOI":"10.1145\/3180155.3180257"},{"key":"9761_CR66","unstructured":"Zabih R, Mcallester D (1988) A rearrangement search strategy for determining propositional satisfiability. In: National conference on artificial intelligence, pp 155\u2013160"},{"issue":"6","key":"9761_CR67","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang Q, Li H (2007) MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712\u2013731","journal-title":"IEEE Trans Evol Comput"},{"key":"9761_CR68","unstructured":"Zhang Q, Zhou A, Zhao S, Suganthan PN, Liu W, Tiwari S (2009) Multiobjective optimization test instances for the CEC 2009 special session and competition. University of Essex, Colchester, UK and Nanyang Technological University, Singapore, Special Session on Performance Assessment of Multi-Objective Optimization Algorithms, Technical Report"},{"issue":"6","key":"9761_CR69","doi-asserted-by":"publisher","first-page":"2073","DOI":"10.1109\/TCYB.2018.2819360","volume":"49","author":"Y Zhou","year":"2019","unstructured":"Zhou Y, Xiang Y, Chen Z, He J, Wang J (2019) A scalar projection and angle based evolutionary algorithm for many-objective optimization problems. IEEE Trans Cybern 49(6):2073\u20132084. \nhttps:\/\/doi.org\/10.1109\/TCYB.2018.2819360","journal-title":"IEEE Trans Cybern"},{"issue":"4","key":"9761_CR70","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans Evol Comput 3(4):257\u2013271","journal-title":"IEEE Trans Evol Comput"},{"key":"9761_CR71","doi-asserted-by":"crossref","unstructured":"Zitzler E, K\u00fcnzli S (2004) Indicator-based selection in multiobjective search. In: Proc. 8th international conference on parallel problem solving from nature, PPSN VIII. Springer, pp 832\u2013842","DOI":"10.1007\/978-3-540-30217-9_84"}],"container-title":["Empirical Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10664-019-09761-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10664-019-09761-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10664-019-09761-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,28]],"date-time":"2020-08-28T23:33:21Z","timestamp":1598657601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10664-019-09761-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,30]]},"references-count":71,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["9761"],"URL":"https:\/\/doi.org\/10.1007\/s10664-019-09761-2","relation":{},"ISSN":["1382-3256","1573-7616"],"issn-type":[{"type":"print","value":"1382-3256"},{"type":"electronic","value":"1573-7616"}],"subject":[],"published":{"date-parts":[[2019,8,30]]},"assertion":[{"value":"30 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}