{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,31]],"date-time":"2025-08-31T10:05:34Z","timestamp":1756634734453},"reference-count":77,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,7,25]],"date-time":"2014-07-25T00:00:00Z","timestamp":1406246400000},"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":["Constraints"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s10601-014-9168-4","type":"journal-article","created":{"date-parts":[[2014,7,24]],"date-time":"2014-07-24T03:00:19Z","timestamp":1406170819000},"page":"30-56","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Large-scale parallelism for constraint-based local search: the costas array case study"],"prefix":"10.1007","volume":"20","author":[{"given":"Yves","family":"Caniou","sequence":"first","affiliation":[]},{"given":"Philippe","family":"Codognet","sequence":"additional","affiliation":[]},{"given":"Florian","family":"Richoux","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Diaz","sequence":"additional","affiliation":[]},{"given":"Salvador","family":"Abreu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,25]]},"reference":[{"key":"9168_CR1","first-page":"164","volume-title":"A case study in running a parallel branch and bound application on the grid","author":"K Aida","year":"2005","unstructured":"Aida, K., & Osumi, T. (2005). A case study in running a parallel branch and bound application on the grid, (pp. 164\u2013173). USA: IEEE Computer Society, Washington, DC."},{"issue":"3","key":"9168_CR2","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1023\/A:1015061802659","volume":"8","author":"R Aiex","year":"2002","unstructured":"Aiex, R., Resende, M., Ribeiro, C. (2002). Probability distribution of solution time in GRASP: An experimental investigation. J. Heuristics, 8(3), 343\u2013373.","journal-title":"J. Heuristics"},{"key":"9168_CR3","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s11590-006-0031-4","volume":"1","author":"R Aiex","year":"2007","unstructured":"Aiex, R., Resende, M., Ribeiro, C. (2007). TTT plots: a Perl program to create time-to-target plots. Optimization Letters, 1, 355\u2013366.","journal-title":"Optimization Letters"},{"issue":"15","key":"9168_CR4","first-page":"253","volume":"105(40)","author":"M Alava","year":"2007","unstructured":"Alava, M., Ardelius, J., Aurell, E., Kaski, P., Orponen, P., Krishnamurthy, S., Seitz, S. (2007). Circumspect descent prevails in solving random constraint satisfaction problems. PNAS, 105(40)(15), 253\u2013257.","journal-title":"PNAS"},{"issue":"3","key":"9168_CR5","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1023\/B:HEUR.0000026984.08350.12","volume":"10","author":"E Alba","year":"2004","unstructured":"Alba, E. (2004). Special issue on new advances on parallel meta-heuristics for complex problems. J. Heuristics, 10(3), 239\u2013380.","journal-title":"J. Heuristics"},{"key":"9168_CR6","unstructured":"Amdahl, G. (1967). Validity of the single processor approach to achieving large scale computing capabilities, (pp. 483\u2013485). New Jersey: ACM Press, Atlantic City. URL http:\/\/doi.acm.org\/10.1145\/1465482.1465560 ."},{"key":"9168_CR7","doi-asserted-by":"crossref","unstructured":"Arbelaez, A., & Codognet, P. (2012). Massively parallel local search for SAT.","DOI":"10.1109\/ICTAI.2012.17"},{"key":"9168_CR8","unstructured":"Arbelaez, A., & Codognet, P. (2013). In M. Middendorf, & C. Blum (Eds.), From sequential to parallel local search for SAT."},{"key":"9168_CR9","unstructured":"Arbelaez, A., & Hamadi, Y. (2011). In Coelo, C. (Ed.), Improving Parallel Local Search for SAT, (p. 2011). Italy: LNCS, Rome."},{"key":"9168_CR10","unstructured":"Balint, A., Fr\u00f6hlich, A., Tompkins, D., Hoos, H. (2011). Sparrow2011."},{"issue":"2","key":"9168_CR11","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1109\/TAES.2007.4285351","volume":"43","author":"J Beard","year":"2007","unstructured":"Beard, J., Russo, J., Erickson, K., Monteleone, M., Wright, M. (2007). Costas array generation and search methodology. IEEE Trans. Aerosp. Electron. Syst., 43(2), 522\u2013538.","journal-title":"IEEE Trans. Aerosp. Electron. Syst."},{"key":"9168_CR12","volume-title":"Simonis, H.","author":"N Beldiceanu","year":"1999","unstructured":"Beldiceanu, N., & Bourreau, E. (1999). Simonis, H. CSPLib website: A note on perfect square placement. http:\/\/www.csplib.org\/prob\/prob009\/helmut.pdf ."},{"issue":"3","key":"9168_CR13","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10288-011-0165-9","volume":"9","author":"T Benoist","year":"2011","unstructured":"Benoist, T., Estellon, B., Gardi, F., Megel, R., Nouioua, K. (2011). Localsolver 1.x: a black-box local-search solver for 0-1 programming. 4OR, 9(3), 299\u2013316.","journal-title":"4OR"},{"key":"9168_CR14","unstructured":"Bessiere, C., & F. Rossi. (2006). In P. van Beek, & T. Walsh (Eds.), Constraint propagation."},{"issue":"1-2","key":"9168_CR15","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/S0004-3702(00)00007-2","volume":"119","author":"S Boettcher","year":"2000","unstructured":"Boettcher, S., & Percus, A. (2000). Nature\u2019s way of optimizing. Artificial Intelligence, 119(1-2), 275\u2013286.","journal-title":"Artificial Intelligence"},{"key":"9168_CR16","unstructured":"Boettcher, S., & Percus, A. (2003). Extremal optimization: an evolutionary local-search algorithm. arXiv: 0209030 ."},{"issue":"4","key":"9168_CR17","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1177\/1094342006070078","volume":"20","author":"R Bolze","year":"2006","unstructured":"Bolze, R. (2006). al.: Grid\u20195000: A large scale and highly reconfigurable experimental grid testbed. Int. J. High Perform. Comput. Appl, 20(4), 481\u2013494.","journal-title":"Int. J. High Perform. Comput. Appl"},{"key":"9168_CR18","unstructured":"Bordeaux, L., Hamadi, Y., Samulowitz, H. (2009). In C. Boutilier (Ed.), Experiments with massively parallel constraint solving."},{"key":"9168_CR19","first-page":"6622","volume-title":"Experiments in parallel constraint-based local search","author":"Y Caniou","year":"2011","unstructured":"Caniou, Y., Codognet, P., Diaz, D., Abreu, S. (2011). Experiments in parallel constraint-based local search, (p. 6622). Italy: Springer Verlag, Torino."},{"key":"9168_CR20","doi-asserted-by":"crossref","unstructured":"Caromel, D., di Costanzo, A., Baduel, L., Matsuoka, S. (2007). Grid\u2019BnB: a parallel branch and bound framework for grids.","DOI":"10.1007\/978-3-540-77220-0_51"},{"issue":"4","key":"9168_CR21","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1109\/PROC.1987.13761","volume":"75","author":"W Chang","year":"1987","unstructured":"Chang, W. (1987). A remark on the definition of Costas arrays. Proc. IEEE, 75(4), 522\u2013523.","journal-title":"Proc. IEEE"},{"issue":"23-24","key":"9168_CR22","doi-asserted-by":"crossref","first-page":"4459","DOI":"10.1016\/j.physa.2011.06.070","volume":"390","author":"YW Chen","year":"2011","unstructured":"Chen, Y.W., Zhu, Y.J., Yang, G.K., Lu, Y.Z. (2011). Improved extremal optimization for the asymmetric traveling salesman problem. Physica A: Statistical Mechanics and its Applications, 390(23-24), 4459\u20134465.","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"9168_CR23","unstructured":"Chu, G., Schulte, C., Stuckey, P. (2009). In I. Gent (Ed.), Confidence-based work stealing in parallel constraint programming."},{"key":"9168_CR24","unstructured":"Chu, G., & Stuckey, P. (2008). A parallelization of MiniSAT 2.0."},{"key":"9168_CR25","doi-asserted-by":"crossref","unstructured":"Codognet, P., & Diaz, D. (2001). Yet another local search method for constraint solving: Springer Verlag.","DOI":"10.1007\/3-540-45322-9_5"},{"key":"9168_CR26","unstructured":"Codognet, P., & Diaz, D. (2003). In T. Ibaraki (Ed.), An efficient library for solving CSP with local search."},{"issue":"8","key":"9168_CR27","doi-asserted-by":"crossref","first-page":"996","DOI":"10.1109\/PROC.1984.12967","volume":"72","author":"J Costas","year":"1984","unstructured":"Costas, J. (1984). A study of detection waveforms having nearly ideal range-doppler ambiguity properties. Proc. IEEE, 72(8), 996\u20131009.","journal-title":"Proc. IEEE"},{"issue":"3","key":"9168_CR28","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1023\/B:HEUR.0000026897.40171.1a","volume":"10","author":"T Crainic","year":"2004","unstructured":"Crainic, T., Gendreau, M., Hansen, P., Mladenovic, N. (2004). Cooperative parallel variable neighborhood search for the -median. J. Heuristics, 10(3), 293\u2013314.","journal-title":"J. Heuristics"},{"issue":"3","key":"9168_CR29","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1023\/A:1015084116772","volume":"8","author":"T Crainic","year":"2002","unstructured":"Crainic, T., & Toulouse, M. (2002). Special issue on parallel meta-heuristics. J. Heuristics, 8(3), 247\u2013388.","journal-title":"J. Heuristics"},{"issue":"6","key":"9168_CR30","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1002\/cpe.1855","volume":"24","author":"D Diaz","year":"2012","unstructured":"Diaz, D., Abreu, S., Codognet, P. (2012). Targeting the cell broadband engine for constraint-based local search. Concurrency and Computation: Practice and Experience, 24(6), 647\u2013660.","journal-title":"Concurrency and Computation: Practice and Experience"},{"key":"9168_CR31","first-page":"7219","volume-title":"Constraint-based local search for the costas array problem","author":"D Diaz","year":"2012","unstructured":"Diaz, D., Richoux, F., Codognet, P., Caniou, Y., Abreu, S. (2012). Constraint-based local search for the costas array problem, (p. 7219). Paris, France: Springer Verlag."},{"key":"9168_CR32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/JAM\/2006\/26385","volume":"2006","author":"K Drakakis","year":"2006","unstructured":"Drakakis, K. (2006). A review of costas arrays. J. Appl. Math., 2006, 1\u201332.","journal-title":"J. Appl. Math."},{"key":"9168_CR33","doi-asserted-by":"crossref","unstructured":"Drakakis, K., Gow, R., Rickard, S. (2008). Distance vectors in costas arrays.","DOI":"10.1109\/CISS.2008.4558707"},{"issue":"1","key":"9168_CR34","doi-asserted-by":"crossref","first-page":"69","DOI":"10.3934\/amc.2011.5.69","volume":"5","author":"K Drakakis","year":"2011","unstructured":"Drakakis, K., Iorio, F., Rickard, S. (2011). The enumeration of costas arrays of order 28 and its consequences. Advances in Mathematics of Communications, 5(1), 69\u201386.","journal-title":"Advances in Mathematics of Communications"},{"issue":"3","key":"9168_CR35","doi-asserted-by":"crossref","first-page":"547","DOI":"10.3934\/amc.2011.5.547","volume":"5","author":"K Drakakis","year":"2011","unstructured":"Drakakis, K., Iorio, F., Rickard, S., Walsh, J. (2011). Results of the enumeration of costas arrays of order 29. Advances in Mathematics of Communications, 5(3), 547\u2013553.","journal-title":"Advances in Mathematics of Communications"},{"key":"9168_CR36","volume-title":"A general approach for constraint solving by local search","author":"P Galinier","year":"2000","unstructured":"Galinier, P., & Hao, J.K. (2000). A general approach for constraint solving by local search. Germany: Paderborn."},{"issue":"6","key":"9168_CR37","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1287\/opre.42.6.1042","volume":"42","author":"B Gendron","year":"1994","unstructured":"Gendron, B., & Crainic, T. (1994). Parallel branch-and-bound algorithms: Survey and synthesis. Oper. Res., 42(6), 1042\u20131066.","journal-title":"Oper. Res."},{"key":"9168_CR38","doi-asserted-by":"crossref","unstructured":"Gent, I., & Walsh, T. (1999). CSPLIB: A benchmark library for constraints: Springer Verlag.","DOI":"10.1007\/978-3-540-48085-3_36"},{"issue":"1","key":"9168_CR39","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0097-3165(84)90015-3","volume":"37","author":"S Golomb","year":"1984","unstructured":"Golomb, S. (1984). Algebraic constructions for Costas arrays. Journal Of Combinatorial Theory Series A, 37(1), 13\u201321.","journal-title":"Journal Of Combinatorial Theory Series A"},{"issue":"9","key":"9168_CR40","doi-asserted-by":"crossref","first-page":"1143","DOI":"10.1109\/PROC.1984.12994","volume":"72","author":"S Golomb","year":"1984","unstructured":"Golomb, S., & Taylor, H. (1984). Constructions and properties of Costas arrays. Proc. IEEE, 72(9), 1143\u20131163.","journal-title":"Proc. IEEE"},{"key":"9168_CR41","unstructured":"Gomes, C., & Sellmann, M. (2004). In M. Wallace (Ed.), Streamlined constraint reasoning: Springer Verlag."},{"key":"9168_CR42","doi-asserted-by":"crossref","unstructured":"(2007). In Gonzalez, T. (Ed.), Handbook of Approximation Algorithms and Metaheuristics: Chapman and Hall \/ CRC.","DOI":"10.1201\/9781420010749"},{"key":"9168_CR43","doi-asserted-by":"crossref","first-page":"245","DOI":"10.3233\/SAT190070","volume":"6","author":"Y Hamadi","year":"2009","unstructured":"Hamadi, Y., Jabbour, S., Sais, L. (2009). ManySAT: a parallel SAT solver. Journal on Satisfiability. Boolean Modeling and Computation, 6, 245\u2013262.","journal-title":"Boolean Modeling and Computation"},{"key":"9168_CR44","unstructured":"Hoos, H., & St\u00fctzle, T. (1998). Evaluating Las Vegas algorithms: Pitfalls and remedies: Morgan Kaufmann."},{"issue":"1-2","key":"9168_CR45","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0004-3702(99)00048-X","volume":"112","author":"H Hoos","year":"1999","unstructured":"Hoos, H., & St\u00fctzle, T. (1999). Towards a characterisation of the behaviour of stochastic local search algorithms for sat. Artif. Intell., 112(1-2), 213\u2013232.","journal-title":"Artif. Intell."},{"issue":"1-2","key":"9168_CR46","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s10472-010-9191-0","volume":"60","author":"F Hutter","year":"2010","unstructured":"Hutter, F., Hoos, H., Leyton-Brown, K. (2010). Tradeoffs in the empirical evaluation of competing algorithm designs. Ann. Math. Artif. Intell., 60(1-2), 65\u201389.","journal-title":"Ann. Math. Artif. Intell."},{"key":"9168_CR47","volume-title":"(eds.)","author":"T Ibaraki","year":"2005","unstructured":"Ibaraki, T., Nonobe, K., Yagiura, M. (2005). (eds.) Metaheuristics: Springer Verlag."},{"key":"9168_CR48","doi-asserted-by":"crossref","unstructured":"Kadioglu, S., & Sellmann, M. (2009). Dialectic search: Springer Verlag.","DOI":"10.1007\/978-3-642-04244-7_39"},{"key":"9168_CR49","unstructured":"Kautz, H., Sabharwal, A., Selman, B. (2008). In A. Biere, M. Heule, H. van Maaren, T. Walsch (Eds.), Incomplete algorithms."},{"key":"9168_CR50","doi-asserted-by":"crossref","unstructured":"Chassin de Kergommeaux, & J., Codognet P. (1994). Parallel logic programming systems. ACM Computing Surveys, 26(3), 295\u2013336.","DOI":"10.1145\/185403.185453"},{"issue":"1-3","key":"9168_CR51","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/j.tcs.2008.06.053","volume":"407","author":"E Maneva","year":"2008","unstructured":"Maneva, E., & Sinclair, A. (2008). On the satisfiability threshold and clustering of solutions of random 3-SAT formulas. Theor. Comput. Sci., 407(1-3), 359\u2013369.","journal-title":"Theor. Comput. Sci."},{"key":"9168_CR52","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1007\/s10601-012-9121-3","volume":"17","author":"R Martins","year":"2012","unstructured":"Martins, R., Manquinho, V., Lynce, I. (2012). An overview of parallel SAT solving. Constraints, 17, 304\u2013347.","journal-title":"Constraints"},{"key":"9168_CR53","unstructured":"Michel, L., See, A., Van Hentenryck, P. (2006). In F. Benhamou (Ed.), Distributed constraint-based local search: Springer Verlag."},{"key":"9168_CR54","unstructured":"Michel, L., See, A., Van Hentenryck, P. (2007). In C. Bessiere (Ed.), Parallelizing constraint programs transparently: Springer Verlag."},{"key":"9168_CR55","doi-asserted-by":"crossref","first-page":"2357","DOI":"10.1016\/j.cor.2008.08.014","volume":"36","author":"L Michel","year":"2009","unstructured":"Michel, L., See, A., Van Hentenryck, P. (2009). Parallel and distributed local search in comet. Comput. Oper. Res., 36, 2357\u20132375.","journal-title":"Comput. Oper. Res."},{"issue":"1-3","key":"9168_CR56","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","volume":"58","author":"S Minton","year":"1992","unstructured":"Minton, S., Johnston, M., Philips, A., Laird, P. (1992). Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems. Artif. Intell., 58(1-3), 161\u2013205.","journal-title":"Artif. Intell."},{"key":"9168_CR57","unstructured":"Moisan, T., Gaudreault, J., Quimper, C.G. (2013). In C. Schulte (Ed.), Parallel discrepancy-based search: Springer."},{"key":"9168_CR58","unstructured":"Ohmura, K. (2009). Ueda, K.: c-SAT: A parallel SAT solver for clusters: Springer Verlag."},{"key":"9168_CR59","unstructured":"Orue, A., \u00c1lvarez, G., Guerra, A., Pastor, G., Romera, M., Montoya, F. (2010). Trident, a new pseudo random number generator based on coupled chaotic maps. CoRR abs\/1008, 2345."},{"key":"9168_CR60","doi-asserted-by":"crossref","unstructured":"Pardalos, P., Pitsoulis, L., Mavridou, T., Resende, M. (1995). Parallel search for combinatorial optimization: Genetic algorithms, simulated annealing, tabu search and GRASP.","DOI":"10.1007\/3-540-60321-2_26"},{"key":"9168_CR61","volume-title":"Constraint Programming on Hierarchical Multiprocessor Systems","author":"V Pedro","year":"2012","unstructured":"Pedro, V. (2012). Constraint Programming on Hierarchical Multiprocessor Systems. Universidade de \u00c9vora: Ph.D. thesis."},{"key":"9168_CR62","doi-asserted-by":"crossref","unstructured":"Perron, L. (1999). Search procedures and parallelism in constraint programming: Springer Verlag.","DOI":"10.1007\/978-3-540-48085-3_25"},{"key":"9168_CR63","unstructured":"R\u00e9gin, J.C., Rezgui, M., Malapert, A. (2013). In C. Schulte (Ed.), Embarrassingly parallel search: Springer Verlag."},{"key":"9168_CR64","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s10898-011-9769-z","volume":"54","author":"C Ribeiro","year":"2012","unstructured":"Ribeiro, C., Rosseti, I., Vallejos, R. (2012). Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms. Journal of Global Optimization, 54, 405\u2013429.","journal-title":"Journal of Global Optimization"},{"key":"9168_CR65","doi-asserted-by":"crossref","DOI":"10.1109\/CISS.2006.286636","volume-title":"Stochastic search for costas arrays","author":"S Rickard","year":"2006","unstructured":"Rickard, S., & Healy, J. (2006). Stochastic search for costas arrays. NJ, USA: Princeton."},{"key":"9168_CR66","doi-asserted-by":"crossref","unstructured":"Russo, J., Erickson, K., Beard, J. (2010). Costas array search technique that maximizes backtrack and symmetry exploitation. CISS, 1\u20138.","DOI":"10.1109\/CISS.2010.5464772"},{"key":"9168_CR67","doi-asserted-by":"crossref","first-page":"203","DOI":"10.3233\/SAT190068","volume":"6","author":"T Schubert","year":"2009","unstructured":"Schubert, T., Lewis, M., Becker, B. (2009). PaMiraXT: Parallel SAT solving with threads and message passing. Journal on Satisfiability. Boolean Modeling and Computation, 6, 203\u2013222.","journal-title":"Boolean Modeling and Computation"},{"key":"9168_CR68","unstructured":"Simonis, H. Limits of propagation (costas array). http:\/\/4c.ucc.ie\/~hsimonis\/ELearning\/costas\/handout.pdf ."},{"key":"9168_CR69","volume-title":"Constraints, local search and computer-aided music composition","author":"C Truchet","year":"2004","unstructured":"Truchet, C. (2004). Constraints, local search and computer-aided music composition. France: Ph.D. thesis, University of Paris-7."},{"key":"9168_CR70","unstructured":"Truchet, C., Richoux, F., Codognet, P. (2013). In J. Dongarra, & Y. Robert (Eds.), Prediction of Parallel Speed-ups for Las Vegas Algorithms."},{"key":"9168_CR71","unstructured":"Van Hentenryck, P. (1989). Constraint Satisfaction in Logic Programming: The MIT Press."},{"key":"9168_CR72","unstructured":"Van Hentenryck, P., & Michel, L. (2005). Constraint-Based Local Search: The MIT Press."},{"key":"9168_CR73","doi-asserted-by":"crossref","unstructured":"Van Luong, T., Melab, N., Talbi, E.G. (2010). Local search algorithms on graphics processing units: Springer Verlag.","DOI":"10.1007\/978-3-642-12139-5_23"},{"key":"9168_CR74","volume-title":"Parallel local search. Ph.D. thesis","author":"M Verhoeven","year":"1996","unstructured":"Verhoeven, M. (1996). Parallel local search. Ph.D. thesis. Netherlands: University of Eindhoven."},{"issue":"1","key":"9168_CR75","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF02430365","volume":"1","author":"M Verhoeven","year":"1995","unstructured":"Verhoeven, M., & Aarts, E. (1995). Parallel local search. Journal of Heuristics, 1(1), 43\u201365.","journal-title":"Journal of Heuristics"},{"issue":"2","key":"9168_CR76","doi-asserted-by":"crossref","first-page":"1637","DOI":"10.1016\/j.amc.2007.02.103","volume":"190","author":"T Xiang","year":"2007","unstructured":"Xiang, T., Liao, X., Wong, K. (2007). An improved particle swarm optimization algorithm combined with piecewise linear chaotic map. Applied Mathematics and Computation, 190(2), 1637\u20131645.","journal-title":"Applied Mathematics and Computation"},{"key":"9168_CR77","doi-asserted-by":"crossref","unstructured":"Xie, F., & Davenport, A. (2010). Massively parallel constraint programming for supercomputers: Challenges and initial results: Springer.","DOI":"10.1007\/978-3-642-13520-0_36"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-014-9168-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-014-9168-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-014-9168-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,22]],"date-time":"2020-08-22T14:39:39Z","timestamp":1598107179000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-014-9168-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,25]]},"references-count":77,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["9168"],"URL":"https:\/\/doi.org\/10.1007\/s10601-014-9168-4","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,25]]}}}