{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,16]],"date-time":"2025-04-16T12:06:15Z","timestamp":1744805175669},"reference-count":86,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T00:00:00Z","timestamp":1408406400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s10489-014-0560-y","type":"journal-article","created":{"date-parts":[[2014,8,18]],"date-time":"2014-08-18T04:54:08Z","timestamp":1408337648000},"page":"897-922","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Conflict-based pruning of a solution space within a constructive geometric constraint solver"],"prefix":"10.1007","volume":"41","author":[{"given":"E.","family":"Yeguas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. J.","family":"Mar\u00edn-Jim\u00e9nez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Mu\u00f1oz-Salinas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Medina-Carnicer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,8,19]]},"reference":[{"key":"560_CR1","doi-asserted-by":"crossref","DOI":"10.1515\/9780691187563","volume-title":"Local Search in Combinatorial Optimization","author":"EHL Aarts","year":"2003","unstructured":"Aarts EHL, Lenstra JK (2003) Local Search in Combinatorial Optimization. Princeton University Press, Princeton"},{"issue":"2","key":"560_CR2","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10489-009-0188-5","volume":"34","author":"CF Ahmed","year":"2011","unstructured":"Ahmed CF, Tanbeer SK, Jeong B-S, Lee Y-K (2011) HUC-Prune: an efficient candidate pruning technique to mine high utility patterns. Appl Intell 34(2):181\u2013198","journal-title":"Appl Intell"},{"issue":"3","key":"560_CR3","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1287\/ijoc.8.3.318","volume":"8","author":"RK Ahuja","year":"1996","unstructured":"Ahuja RK, Orlin JB (1996) Use of representative operation counts in computational testing of algorithms. INFORMS J Comput 8(3):318\u2013330","journal-title":"INFORMS J Comput"},{"key":"560_CR4","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1109\/VIZ.2009.29","volume-title":"Proceedings of the 2009 Second international conference in visualisation. VIZ \u201909","author":"S Ait-Aoudia","year":"2009","unstructured":"Ait-Aoudia S, Bahriz M, Salhi L (2009) 2d geometric constraint solving: An overview. In: Proceedings of the 2009 Second international conference in visualisation. VIZ \u201909. IEEE Computer Society, Washington, pp 201\u2013206"},{"issue":"3","key":"560_CR5","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0010-4485(88)90019-X","volume":"20","author":"B Aldefeld","year":"1988","unstructured":"Aldefeld B (1988) Variation of geometrics based on a geometric-reasoning method. Comput Aided Des 20(3):117\u2013126","journal-title":"Comput Aided Des"},{"key":"560_CR6","volume-title":"Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning. Technical Report CMU-CS-94-163","author":"S Baluja","year":"1994","unstructured":"Baluja S (1994) Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning. Technical Report CMU-CS-94-163. Carnegie Mellon University, Pittsburgh"},{"issue":"2","key":"560_CR7","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s11047-008-9098-4","volume":"8","author":"L Bianchi","year":"2009","unstructured":"Bianchi L, DorigoM, Gambardella LM, Gutjahr WJ (2009) A survey on metaheuristics for stochastic combinatorial optimization. Nat Comput 8(2):239\u2013287","journal-title":"Nat Comput"},{"key":"560_CR8","unstructured":"Birattari M, Paquete L, Sttzle T, Varrentrapp K (2001) Classification of metaheuristics and design of experiments for the analysis of components. Technical Report AIDA-01-05, Darmstadt University of Technology"},{"issue":"2","key":"560_CR9","doi-asserted-by":"crossref","first-page":"1161","DOI":"10.1109\/TSMCB.2003.821450","volume":"34","author":"C Blum","year":"2004","unstructured":"Blum C, Dorigo M (2004) The hyper-cube framework for ant colony optimization. IEEE Trans Syst Man Cybern - Part B 34(2):1161\u20131172","journal-title":"IEEE Trans Syst Man Cybern - Part B"},{"issue":"3","key":"560_CR10","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Comput Surv 35(3):268\u2013308","journal-title":"ACM Comput Surv"},{"key":"560_CR11","doi-asserted-by":"crossref","unstructured":"Borcea C, Streinu I (2002) On the number of embeddings of minimally rigid graphs. SoCG\u201902","DOI":"10.1145\/513400.513404"},{"issue":"6","key":"560_CR12","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1016\/0010-4485(94)00013-4","volume":"27","author":"W Bouma","year":"1995","unstructured":"Bouma W, Fudos I, Hoffman C, Cai J, Paige R (1995) Geometric constraint solver. Comput Aided Des 27(6):487\u2013501","journal-title":"Comput Aided Des"},{"key":"560_CR13","unstructured":"Br\u00fcderlin BD (1990) Symbolic computer geometry for computer aided geometric design. In: Advances in design and manufacturing systems. Proceedings NSF Conference, Tempe"},{"issue":"7","key":"560_CR14","first-page":"25","volume":"1","author":"B Bullnheimer","year":"1999","unstructured":"Bullnheimer B, Hartl R F, Strau\u03b2 C (1999) A new rank based version of the ant system: a computational study. Cent Eur J Oper Res Econ 1(7):25\u201338","journal-title":"Cent Eur J Oper Res Econ"},{"key":"560_CR15","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1162\/evco.1994.2.4.321","volume":"2","author":"W Cede\u00f1o","year":"1994","unstructured":"Cede\u00f1o W, Vemuri V R, Slezak T (1994) Multiniche crowding in genetic algorithms and its application to the assembly of dna restriction-fragments. Evol Comput 2:321\u2013345","journal-title":"Evol Comput"},{"issue":"8","key":"560_CR16","first-page":"397","volume":"29","author":"C Chunhong","year":"2004","unstructured":"Chunhong C (2004) The application of crossbreeding particle swarm optimizer in the engineering geometric constraint solving. Chin J Sci Instrum 29(8):397\u2013400","journal-title":"Chin J Sci Instrum"},{"issue":"4","key":"560_CR17","first-page":"46","volume":"4","author":"C Chunhong","year":"2004","unstructured":"Chunhong C (2004) Improved ant colony algorithm applied in constraint solving. J Eng Graph 4(4):46\u201350","journal-title":"J Eng Graph"},{"key":"560_CR18","first-page":"228","volume-title":"ANTS \u201902: Proceedings of the third international workshop on ant algorithms","author":"O Cord\u00f3n","year":"2002","unstructured":"Cord\u00f3n O, Fern\u00e1ndez de Viana I, Herrera F (2002) Analysis of the best-worst ant system and its variants on the QAP. In: ANTS \u201902: Proceedings of the third international workshop on ant algorithms. Springer-Verlag, London, pp 228\u2013234"},{"key":"560_CR19","doi-asserted-by":"crossref","unstructured":"Deb K (2005) Multi-objective optimization. In: Burke EK and Kendall G (eds) Search methodologies. Springer, pp 273\u2013316","DOI":"10.1007\/0-387-28356-0_10"},{"key":"560_CR20","volume-title":"Probability and statistics for engineering and the sciences","author":"JL Devore","year":"2004","unstructured":"Devore JL (2004) Probability and statistics for engineering and the sciences, 6th. Duxburg and Brooks Cole, Pacific Grove"},{"issue":"1","key":"560_CR21","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern - Part B 26(1):29\u201341","journal-title":"IEEE Trans Syst Man Cybern - Part B"},{"key":"560_CR22","doi-asserted-by":"crossref","unstructured":"Dorigo M, St\u00fctzle T (2004) Ant colony optimization. MIT Press","DOI":"10.1007\/b99492"},{"key":"560_CR23","unstructured":"Eiben AE, Ruttkay Zs (1997) Constraint-satisfaction problems. In: B\u00e4ck T, Fogel D andMichalewicz Z (eds) Handbook of evolutionary computation. Institute of Physics Publishing Ltd and Oxford University Press, pp C5.7:1\u2013C5.7:5"},{"key":"560_CR24","doi-asserted-by":"crossref","unstructured":"Eshelman LJ (1991) The CHC adaptative search algorithm: how to safe search when engaging in nontraditional genetic recombination. Found Genet Algoritm I 265\u2013283","DOI":"10.1016\/B978-0-08-050684-5.50020-3"},{"key":"560_CR25","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0004-3702(00)00061-8","volume":"124","author":"C Essert-Villard","year":"2000","unstructured":"Essert-Villard C, Schreck P, Dufourd J-F (2000) Sketch-based pruning of a solution space within a formal geometric constraint solver. Artif Intell 124:139\u2013159","journal-title":"Artif Intell"},{"key":"560_CR26","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/1364901.1364909","volume-title":"SPM \u201908: Proceedings of the 2008 ACM symposium on Solid and physical modeling","author":"M Freixas","year":"2008","unstructured":"Freixas M, Joan-Arinyo R, Soto-Riera A (2008) A constraint-based dynamic geometry system. In: SPM \u201908: Proceedings of the 2008 ACM symposium on Solid and physical modeling. ACM, New York, pp 37\u201346"},{"issue":"200","key":"560_CR27","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1080\/01621459.1937.10503522","volume":"32","author":"M Friedman","year":"1937","unstructured":"Friedman M (1937) The use of ranks to avoid the assumption of normality implicit in the analysis of variance. J Am Stat Assoc 32(200):675\u2013701","journal-title":"J Am Stat Assoc"},{"issue":"2","key":"560_CR28","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1145\/248210.248223","volume":"16","author":"I Fudos","year":"1997","unstructured":"Fudos I, Hoffmann CM (1997) A graph-constructive approach to solving systems of geometric constraints. ACM Trans Graph 16(2):179\u2013216","journal-title":"ACM Trans Graph"},{"issue":"10","key":"560_CR29","doi-asserted-by":"crossref","first-page":"2044","DOI":"10.1016\/j.ins.2009.12.010","volume":"180","author":"S Garc\u00eda","year":"2010","unstructured":"Garc\u00eda S, Fern\u00e1ndez A, Luengo J, Herrera F (2010) Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and datamining: Experimental analysis of power. Inf Sci 180(10):2044\u20132064","journal-title":"Inf Sci"},{"key":"560_CR30","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco"},{"issue":"14","key":"560_CR31","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1016\/S0010-4485(99)00074-3","volume":"31","author":"J-X Ge","year":"1999","unstructured":"Ge J-X, Chou S-C, Gao X-S (1999) Geometric constraint satisfaction using optimization methods. Comput Aided Des 31(14):867\u2013879","journal-title":"Comput Aided Des"},{"key":"560_CR32","volume-title":"Modern heuristic techniques for combinatorial problems","author":"Glover F","year":"1993","unstructured":"Glover F, Laguna M (1993) Tabu search. In: Reeves C (ed) Modern heuristic techniques for combinatorial problems. Blackwell Scientific Publishing, Oxford"},{"key":"560_CR33","unstructured":"Goldberg DE, Richardson J (1987) Genetic algorithms with sharing for multimodal function optimization. In: Second international conference on genetic algorithms. pp 41\u201349"},{"issue":"1","key":"560_CR34","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10489-012-0394-4","volume":"39","author":"D Guo","year":"2013","unstructured":"Guo D, Hu X, Xie F, Wu X (2013) Pattern matching with wildcards and gap-length constraints based on a centrality-degree graph. Appl Intell 39(1):57\u201374","journal-title":"Appl Intell"},{"key":"560_CR35","volume-title":"Linkage learning via probabilistic modeling in the ECGA. Technical Report 99010","author":"GR Harik","year":"1999","unstructured":"Harik GR (1999) Linkage learning via probabilistic modeling in the ECGA. Technical Report 99010. University of Illinois, Illinois"},{"issue":"2","key":"560_CR36","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1109\/4235.797971","volume":"3","author":"GR Harik","year":"1999","unstructured":"Harik GR, Lobo FG, Goldberg DE (1999) The compact genetic algorithm. IEEE Trans Evol Comput 3(2):287\u2013297","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"560_CR37","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10489-011-0321-0","volume":"37","author":"A-R Hedar","year":"2012","unstructured":"Hedar A-R, Ali AF (2012) Tabu search with multi-level neighborhood structures for high dimensional problems. Appl Intell 37(2):189\u2013206","journal-title":"Appl Intell"},{"issue":"1","key":"560_CR38","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s10817-013-9280-y","volume":"52","author":"MR Hidalgo","year":"2014","unstructured":"Hidalgo MR, Joan-Arinyo R (2014) The reachability problem in constructive geometric constraint solving based dynamic geometry. J Autom Reason 52(1):99\u2013122","journal-title":"J Autom Reason"},{"issue":"1","key":"560_CR39","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/322290.322295","volume":"29","author":"CM Hoffmann","year":"1982","unstructured":"Hoffmann CM, O\u2019Donnell MJ (1982) Pattern matching in trees. J ACM 29(1):68\u201395","journal-title":"J ACM"},{"issue":"4","key":"560_CR40","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/S0010-4485(03)00099-X","volume":"36","author":"CM Hoffmann","year":"2004","unstructured":"Hoffmann CM, Sitharam M, Yuan B (2004) Making constraint solvers more usable: overconstraint problem. Comput-Aided Des 36(4):377\u2013399","journal-title":"Comput-Aided Des"},{"issue":"5","key":"560_CR41","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1080\/16864360.2005.10738330","volume":"2","author":"CM Hoffmann","year":"2005","unstructured":"Hoffmann CM, Joan-Arinyo R (2005) A brief on constraint solving. Comput-Aided Des Appl 2(5):655\u2013663","journal-title":"Comput-Aided Des Appl"},{"key":"560_CR42","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1006\/jsco.2000.0403","volume":"31","author":"CM Hoffmann","year":"2001","unstructured":"Hoffmann CM, Lomonosov A, SitharamM(2001) Decomposition plans for geometric constraint. problems, part II: new algorithms. J Symb Comput 31:409\u2013427","journal-title":"J Symb Comput"},{"key":"560_CR43","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1006\/jsco.2000.0402","volume":"31","author":"CM Hoffmann","year":"2001","unstructured":"Hoffmann CM, Lomonosov A, Sitharam M (2001) Decomposition plans for geometric constraint. systems, part I: performance measurements for CAD. J Symb Comput 31:367\u2013408","journal-title":"J Symb Comput"},{"key":"560_CR44","volume-title":"Adaptation in natural and artificial systems","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems. MIT Press, Cambridge"},{"key":"560_CR45","first-page":"65","volume":"6","author":"S Holm","year":"1979","unstructured":"Holm S (1979) A simple sequentially rejective multiple test procedure. Scand J Stat 6:65\u201370","journal-title":"Scand J Stat"},{"key":"560_CR46","unstructured":"Hoos HH, St\u00fctzle T (1998) Evaluating Las Vegas algorithms Pitfalls and remedies. In: Proceedings of the 14th conference on uncertainly in artificial intelligence. Morgan Kaufmann, pp 238\u2013245"},{"issue":"5\u20136","key":"560_CR47","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1142\/S0218195906002105","volume":"16","author":"C Jermann","year":"2006","unstructured":"Jermann C, Trombettoni G, Neveu B, Mathis P (2006) Decomposition of geometric constraint systems: a survey. Int J Comput Geometry Appl 16(5\u20136):379\u2013414","journal-title":"Int J Comput Geometry Appl"},{"key":"560_CR48","unstructured":"Joan-Arinyo R, Luz\u00f3n MV, Yeguas E (2008) Parameter tuning for PBIL algorithm in geometric constraint solving systems. In: World congress in computer science, Computer Engineering and Applied Computing. International Conference on Genetics and Evolutionary Methods. pp 69\u201375"},{"issue":"1","key":"560_CR49","doi-asserted-by":"crossref","first-page":"15","DOI":"10.3722\/cadaps.2009.15-25","volume":"6","author":"R Joan-Arinyo","year":"2009","unstructured":"Joan-Arinyo R, Luzon MV, Yeguas E (2009) Search space pruning to solve the root identification problem in geometric constraint solving. Comput-Aided Des Appl 6(1):15\u201325","journal-title":"Comput-Aided Des Appl"},{"key":"560_CR50","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1016\/j.asoc.2009.12.037","volume":"11","author":"R Joan-Arinyo","year":"2011","unstructured":"Joan-Arinyo R, Luz\u00f3n MV, Yeguas E (2011) Parameter tuning of pbil and chc evolutionary algorithms applied to solve the root identification problem. Appl Soft Comput 11:754\u2013767","journal-title":"Appl Soft Comput"},{"issue":"1","key":"560_CR51","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1145\/300776.300780","volume":"18","author":"R Joan-Arinyo","year":"1999","unstructured":"Joan-Arinyo R, Soto-Riera A (1999) Combining constructive and equational geometric constraint solving techniques. ACM Trans Graph 18(1):35\u201355","journal-title":"ACM Trans Graph"},{"key":"560_CR52","doi-asserted-by":"crossref","unstructured":"Joan-Arinyo R, Soto-Riera A, Vila-Marta S, Vilaplana J (2001) On the domain of constructive geometric constraint solving techniques. In: in SCCG\u201901: Proceedings of the 17th Spring conference on Computer graphics. pp 49\u201354","DOI":"10.1109\/SCCG.2001.945336"},{"key":"560_CR53","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/781606.781616","volume-title":"Proceedings of the eighth ACM symposium on Solid modeling and applications, SM \u201903","author":"R Joan-Arinyo","year":"2003","unstructured":"Joan-Arinyo R, Soto-Riera A, Vila-Marta S, Vilaplana-Past\u00f3 J (2003) Transforming an under-constrained geometric constraint problem into a well-constrained one. In: Proceedings of the eighth ACM symposium on Solid modeling and applications, SM \u201903. ACM, New York, pp 33\u201344"},{"key":"560_CR54","doi-asserted-by":"crossref","unstructured":"Joan-Arinyo R, Luz\u00f3n MV, Soto-Riera A (2002) Constructive geometric constraint solving: A new application of genetic algorithms. In: PPSN. pp 759\u2013768","DOI":"10.1007\/3-540-45712-7_73"},{"key":"560_CR55","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/1629255.1629270","volume-title":"2009 SIAM\/ACM Joint Conference on Geometric and Physical Modeling. SPM \u201909","author":"R Joan-Arinyo","year":"2009","unstructured":"Joan-Arinyo R, Tarr\u00e9s-Puertas M, Vila-Marta S (2009) Treedecomposition of geometric constraint graphs based on computing graph circuits. In: 2009 SIAM\/ACM Joint Conference on Geometric and Physical Modeling. SPM \u201909. ACM, New York, pp 113\u2013122"},{"key":"560_CR56","volume-title":"Evolutionary Computation: a unified approach","author":"KA De Jong","year":"2006","unstructured":"De Jong KA (2006) Evolutionary Computation: a unified approach. MIT Press, Cambridge"},{"issue":"4598","key":"560_CR57","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"key":"560_CR58","doi-asserted-by":"crossref","unstructured":"Kliewer G, Tsch\u00f6ke S (2000) A general parallel simulated annealing library and its application in airline industry. In: 14th International Parallel and Distributed Processing Symposium (IPDPS). Cancun, Mexico pp 55\u201361","DOI":"10.1109\/IPDPS.2000.845964"},{"key":"560_CR59","doi-asserted-by":"crossref","unstructured":"Larra\u00f1aga P, Lozano JA (2002) Estimation of distribution algorithms: a new tool for evolutionary computation. Springer","DOI":"10.1007\/978-1-4615-1539-5"},{"issue":"2","key":"560_CR60","doi-asserted-by":"crossref","first-page":"174","DOI":"10.15837\/ijccc.2007.2.2350","volume":"2","author":"N Liouane","year":"2007","unstructured":"Liouane N, Saad I, Hammadi S, Borne P (2007) Ant systems and local search optimization for flexible job shop scheduling production. Int J Comput Commun Control 2(2):174\u2013184","journal-title":"Int J Comput Commun Control"},{"key":"560_CR61","unstructured":"Lu H-T, Yang W (2000) A simple tree Pattern-Matching algorithm. In: Proceedings of the workshop on algorithms and theory of computation (ICS \u201900)"},{"issue":"3039","key":"560_CR62","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/978-3-540-25944-2_18","volume":"4","author":"MV Luz\u00f3n","year":"2004","unstructured":"Luz\u00f3n MV, Barreiro E, Yeguas E, Joan-Arinyo R (2004) GA and CHC two evolutionary algorithms to solve the root identification problem in geometric constraint solving. Lect Notes Comput Sci 4(3039):139\u2013146","journal-title":"Lect Notes Comput Sci"},{"key":"560_CR63","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s10489-005-5600-1","volume":"22","author":"MV Luz\u00f3n","year":"2005","unstructured":"Luz\u00f3n MV, Soto A, G\u00e1lvez JF, Joan-Arinyo R (2005) Searching the solution space in constructive geometric constraint solving with genetic algorithms. Appl Intell 22:109\u2013124","journal-title":"Appl Intell"},{"key":"560_CR64","doi-asserted-by":"crossref","unstructured":"Mart\u00ed R (2003) Handbook of metaheuristics, chapter multi start methods. Kluwer Academic Publishers, pp 355\u2013368","DOI":"10.1007\/0-306-48056-5_12"},{"key":"560_CR65","unstructured":"Mata N (2000) Constructible geometric problems with interval parameters. PhD thesis, Departament de Llenguatges i Sistemes Inform\u00e0tics, Universitat Polit\u00e8cnica de Catalunya Barcelona, Spain"},{"issue":"1","key":"560_CR66","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01191205","volume":"12","author":"GL Miller","year":"1992","unstructured":"Miller GL, Ramachandran V (1992) A new graph triconnectivity algorithm and its parallelization. Combinatorica 12(1):53\u201376","journal-title":"Combinatorica"},{"key":"560_CR67","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"N Mladenovi\u0107","year":"2001","unstructured":"Mladenovi\u0107 N, Hansen P (2001) Variable neighborhood search: Principles and applications. Eur J Oper Res 130:449\u2013467","journal-title":"Eur J Oper Res"},{"key":"560_CR68","volume-title":"Tournament selection, niching and the preservation of diversity. Technical Report 91011","author":"CK Oei","year":"1991","unstructured":"Oei CK, Goldberg DE, Chang SJ (1991) Tournament selection, niching and the preservation of diversity. Technical Report 91011. University of Illinois, Illinois"},{"key":"560_CR69","doi-asserted-by":"crossref","unstructured":"Owen Owen JC (1991) Algebraic solution for geometry from dimensional constraints. In: Rossignac R, Turner J (eds) Symposium on solid modeling foundations and CAD\/CAM applications. ACM Press, Austin, pp 397\u2013407","DOI":"10.1145\/112515.112573"},{"issue":"3\u20134","key":"560_CR70","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1023\/A:1024649709582","volume":"14","author":"E P\u00e9rez","year":"2003","unstructured":"P\u00e9rez E, Herrera F, Hern\u00e1ndez C (2003) Finding multiple solutions in job shop scheduling by niching genetic algorithms. J Intell Manuf 14(3\u20134):323\u2013339","journal-title":"J Intell Manuf"},{"key":"560_CR71","doi-asserted-by":"crossref","unstructured":"P\u00e8trowski A (1996) Clearing procedure as a niching method for genetic algorithms. In: IEEE International Conference on Evolutionary Computation. Nagoya, pp 798\u2013803","DOI":"10.1109\/ICEC.1996.542703"},{"key":"560_CR72","unstructured":"Ramalhino H, Martin O, St\u00fctzle T (2002) Iterated local search. In: Glover F, Kochenberger G (eds) Handbook of Metaheuristics, pp 321\u2013353"},{"key":"560_CR73","unstructured":"Russell SJ, Norvig P (2003) Artificial intelligence: a modern approach, 2nd edition. Prentice Hall"},{"issue":"3","key":"560_CR74","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1109\/4235.735432","volume":"2","author":"B Sareni","year":"1998","unstructured":"Sareni B, Kr\u00e4henb\u00fchl L (1998) Fitness sharing and niching methods revisited. IEEE Trans Evol Comput 2(3):97\u2013106","journal-title":"IEEE Trans Evol Comput"},{"key":"560_CR75","unstructured":"Sheng-Li L, Min T, Shang-Ching C, Jin-Xiang D (2004) Solving geometric constraints with niche genetic simulated annealing algorithm. In: Computer supported cooperative work in design. Proceedings. The 8th international conference on, vol. 1. pp 679\u2013684"},{"key":"560_CR76","unstructured":"SolBCN GCS (2011) Solbcn a constraint-based two dimensional geometric editor. Geometric Constraint Solving Group of the Universitat Polit\u00e8cnica de Catalunya"},{"issue":"1","key":"560_CR77","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10489-013-0443-7","volume":"40","author":"W Song","year":"2014","unstructured":"Song W, Liu Y, Li J (2014) Mining high utility itemsets by dynamically pruning the tree structure. Appl Intell 40(1):29\u201343","journal-title":"Appl Intell"},{"issue":"8","key":"560_CR78","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle T, Hoos HH (2000) Max-min ant system. Future Gener Comput Syst 16(8):889\u2013914","journal-title":"Future Gener Comput Syst"},{"key":"560_CR79","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/978-3-540-24855-2_21","volume":"3103\/2004","author":"D Thierens","year":"2004","unstructured":"Thierens D Thierens D (2004) Population-based iterated local search: restricting neighborhood search by crossover. Lect Notes Comput Sci 3103\/2004:234\u2013245","journal-title":"Lect Notes Comput Sci"},{"key":"560_CR80","unstructured":"Vila S (2003) Contribution to geometric constraint solving in cooperative engineering. PhD thesis, Departament de Llenguatges i Sistemes Inform\u00e0tics, Universitat Polit\u00e8cnica de Catalunya, Barcelona, Spain"},{"key":"560_CR81","doi-asserted-by":"crossref","unstructured":"Wu Y, Wang L, Ren J, Ding W, Wu X (2014) Mining sequential patterns with periodic wildcard gaps. Appl Intell:1\u201318","DOI":"10.1007\/s10489-013-0499-4"},{"key":"560_CR82","unstructured":"Yeguas E (2011) Benchmark for the root identification problem in geometric constraint solving. Comput Aided Des. URL http:\/\/www.uco.es\/in1yeboe\/benchmark.html"},{"key":"560_CR83","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1162\/EVCO_a_00017","volume":"19","author":"E Yeguas","year":"2011","unstructured":"Yeguas E, Joan-Arinyo R, Luz\u00b4on MV (2011) Modelling the performance of evolutionary algorithms on the root identification problem: a case study with PBIL and CHC algorithms. Evol Comput 19:107\u2013135","journal-title":"Evol Comput"},{"key":"560_CR84","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.asoc.2014.01.032","volume":"18","author":"E Yeguas","year":"2014","unstructured":"Yeguas E, Luz\u00f3n MV, Pav\u00f3n R, Laza R, Arroyo G, D\u00edaz F (2014) Automatic parameter tuning for evolutionary algorithms using a bayesian case-based reasoning system. Appl Soft Comput 18:185\u2013195","journal-title":"Appl Soft Comput"},{"key":"560_CR85","doi-asserted-by":"crossref","unstructured":"Yuan H, Li Y, Li W, Zhao K, Wang D, Yi R (2008) Combining immune with ant colony algorithm for geometric constraint solving. In: Knowledge discovery and data mining. WKDD 2008. First International Workshop on, pp 524\u2013527","DOI":"10.1109\/WKDD.2008.58"},{"key":"560_CR86","doi-asserted-by":"crossref","unstructured":"Zhang Y, Liu K, Liu G, Zhao Z (2010) A concurrent-hybrid evolutionary algorithm for geometric constraint solving. In: Cai Z, Tong H, Kang Z, Liu Y (eds) Computational intelligence and intelligent systems, vol 107 of Communications in Computer and Information Science. Springer, Berlin, pp 1\u201310","DOI":"10.1007\/978-3-642-16388-3_1"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-014-0560-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-014-0560-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-014-0560-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T02:37:04Z","timestamp":1565750224000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-014-0560-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,19]]},"references-count":86,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["560"],"URL":"https:\/\/doi.org\/10.1007\/s10489-014-0560-y","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,19]]}}}