{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T08:47:18Z","timestamp":1749804438334,"version":"3.40.4"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319112701"},{"type":"electronic","value":"9783319112718"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-11271-8_6","type":"book-chapter","created":{"date-parts":[[2014,10,16]],"date-time":"2014-10-16T06:07:09Z","timestamp":1413439629000},"page":"79-96","source":"Crossref","is-referenced-by-count":3,"title":["Basic and Hybrid Imperialist Competitive Algorithms for Solving the Non-attacking and Non-dominating n-Queens Problems"],"prefix":"10.1007","author":[{"given":"Nasrin","family":"Mohabbati-Kalejahi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hossein","family":"Akbaripour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ellips","family":"Masehian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Abramson, B., Yung, M.: Divide and conquer under global constraints: A solution to the n-queens problem. Journal of Parallel and Distributed Computing\u00a06(3), 649\u2013662 (1989)","DOI":"10.1016\/0743-7315(89)90011-7"},{"key":"6_CR2","volume-title":"Mathematische Unterhaltungen And Spiele","author":"W.E. Ahrens","year":"1901","unstructured":"Ahrens, W.E.: Mathematische Unterhaltungen And Spiele. Teubner, Leipzig (1901)"},{"key":"6_CR3","unstructured":"Ainlet, S.: Mathematical Puzzles. G. Bell & Sons, U.K. (1977)"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Amooshahi, A., Joudaki, M., Imani, M., Mazhari, N.: Presenting a new method based on cooperative PSO to solve permutation problems: A case study of n-queen problem. In: 3rd Int. Conference on Electronics Computer Technology (ICECT), vol.\u00a04, pp. 218\u2013222 (2011)","DOI":"10.1109\/ICECTECH.2011.5941890"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Atashpaz-Gargari, E., Lucas, C.: Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition. In: IEEE Congress on Evolutionary Computation, pp. 4661\u20134667 (2007)","DOI":"10.1109\/CEC.2007.4425083"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.disc.2007.12.043","volume":"309","author":"J. Bell","year":"2009","unstructured":"Bell, J., Stevens, B.: A survey of known results and research areas for n-queens. Discrete Mathematics\u00a0309, 1\u201331 (2009)","journal-title":"Discrete Mathematics"},{"key":"6_CR7","unstructured":"Bezzel, M.: Proposal of 8-queens problem. Berliner Schachzeitung 3, 363 (1848)"},{"key":"6_CR8","unstructured":"Bracamonte, D.: Argentinian newsletter El Acertijo (Los Acertijeros Boletin), vol.\u00a0(6) (1993), http:\/\/revista-el-acertijo.com.ar (retrieved)"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1287\/ijoc.1030.0057","volume":"17","author":"V. Campos","year":"2005","unstructured":"Campos, V., Laguna, M., Mart, R.: Context-independent scatter search and tabu search for permutation problems. INFORMS J. Computing\u00a017, 111\u2013122 (2005)","journal-title":"INFORMS J. Computing"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Dirakkhunakon, S., Suansook, Y.: Simulated Annealing with iterative improvement. In: International Conference on Signal Processing Systems, pp. 302\u2013306 (2009)","DOI":"10.1109\/ICSPS.2009.61"},{"issue":"1","key":"6_CR11","first-page":"21","volume":"7","author":"A. Draa","year":"2010","unstructured":"Draa, A., Meshoul, S., Talbi, H., Batouche, M.: A Quantum-Inspired Differential Evolution Algorithm for Solving the n-Queens Problem. The International Arab Journal of Information Technology\u00a07(1), 21\u201327 (2010)","journal-title":"The International Arab Journal of Information Technology"},{"key":"6_CR12","unstructured":"Draa, A., Talbi, H., Batouche, M.: A Quantum Inspired Genetic Algorithm for Solving the N-Queens Problem. In: Proceedings of the 7th International Symposium on Programming and Systems, pp. 145\u2013152 (2005)"},{"key":"6_CR13","unstructured":"Dudeney, H.E.: Amusements in mathematics. Nelson and sons (1917)"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Erbas, C., Sarkeshik, S., Tanik, M.M.: Different perspectives of the n-queens problem. In: Proceedings of the 1992 ACM Annual Conference on Communications, pp. 99\u2013108. ACM Press (1992)","DOI":"10.1145\/131214.131227"},{"key":"6_CR15","unstructured":"Ghersi, I.: Mathematica dilettevole curiosa. Hoepli, Milan (1913)"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Homaifar, A., Turner, J., Ali, S.: The n-Queens Problem and Genetic Algorithms. In: Proceedings IEEE Southeast Conference, vol.\u00a01, pp. 262\u2013267 (1992)","DOI":"10.1109\/SECON.1992.202348"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Jagota, A.: Optimization by reduction to maximum clique. In: IEEE International Conference on Neural Networks, vol.\u00a03, pp. 1526\u20131531 (1993)","DOI":"10.1109\/ICNN.1993.298783"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of IEEE Int\u2019l. Conf. on Neural Networks, vol.\u00a0IV, pp. 1942\u20131948 (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Khan, S., Bilal, M., Sharif, M., Sajid, M., Baig, R.: Solution of n-Queen Problem Using ACO. In: IEEE 13th International Multi-Topic Conference, pp. 1\u20135 (2009)","DOI":"10.1109\/INMIC.2009.5383157"},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.asoc.2009.07.012","volume":"10","author":"Y. Kilani","year":"2010","unstructured":"Kilani, Y.: Comparing the performance of the genetic and local search algorithms for solving the satisfiability problems. Applied Soft Computing\u00a010, 198\u2013207 (2010)","journal-title":"Applied Soft Computing"},{"key":"6_CR21","unstructured":"Kosters, W.: n-Queens Bibliography (2012), http:\/\/www.liacs.nl\/~kosters\/nqueens\/ (retrieved May 4, 2012)"},{"key":"6_CR22","unstructured":"Kurchan, R.: Argentinian newsletter El Acertijo (Los Acertijeros Boletin), vol.\u00a0(13) (1994), http:\/\/revista-el-acertijo.com.ar (retrieved)"},{"key":"6_CR23","unstructured":"Kurchan, R.: Argentinian newsletter El Acertijo (Los Acertijeros Boletin), vol.\u00a0(26) (1997), http:\/\/revista-el-acertijo.com.ar (retrieved)"},{"key":"6_CR24","unstructured":"Lemaire, B., Vitushinkiy, P.: Placing n non dominating queens on the n\u00d7n chessboard. Rretrieved from website of the \u201cF\u00e9d\u00e9ration Fran\u00e7aise des Jeux Math\u00e9matiques\u201d"},{"key":"6_CR25","first-page":"560","volume":"28","author":"F.J.E. Lionnet","year":"1869","unstructured":"Lionnet, F.J.E.: Question 963. Nouvelles Annales de Math\u00e9matiques\u00a028, 560 (1869)","journal-title":"Nouvelles Annales de Math\u00e9matiques"},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"Martinjak, I., Golub, M.: Comparison of Heuristic Algorithms for the N-Queen Problem. In: Proceedings of the ITI 2007 29th International. Conference on Information Technology Interfaces, pp. 25\u201328 (2007)","DOI":"10.1109\/ITI.2007.4283867"},{"key":"6_CR27","doi-asserted-by":"publisher","first-page":"7615","DOI":"10.1016\/j.eswa.2010.04.081","volume":"37","author":"S. Nazari-Shirkouhi","year":"2010","unstructured":"Nazari-Shirkouhi, S., Eivazy, H., Ghodsi, R., Rezaie, K., Atashpaz-Gargari, E.: Solving the integrated product mix-outsourcing problem using the Imperialist Competitive Algorithm. Expert Systems with Applications\u00a037, 7615\u20137626 (2010)","journal-title":"Expert Systems with Applications"},{"issue":"9","key":"6_CR28","first-page":"257","volume":"29","author":"E. Pauls","year":"1874","unstructured":"Pauls, E.: Das Maximalproblem der Damen auf dem Schachbrete, II, Deutsche Schachzeitung. Organ fur das Gesammte Schachleben\u00a029(9), 257\u2013267 (1874)","journal-title":"Organ fur das Gesammte Schachleben"},{"key":"6_CR29","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0020-0190(92)90168-U","volume":"41","author":"I. Rivin","year":"1992","unstructured":"Rivin, I., Zabih, R.: A Dynamic Programming Solution to the n-Queens Problem. Information Processing Letters\u00a041, 253\u2013256 (1992)","journal-title":"Information Processing Letters"},{"key":"6_CR30","unstructured":"Rouse, W.W.: Mathematical Recreations and Problems of Past and Present Times, 3rd edn. McMillan (1896)"},{"key":"6_CR31","unstructured":"Russell, S.J., Norvig, P.: Artificial Intelligence A Modern Approach. Prentice-Hall Inc., NJ (1995)"},{"key":"6_CR32","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s10898-011-9653-x","volume":"51","author":"P. San Segundo","year":"2011","unstructured":"San Segundo, P.: New decision rules for exact search in n-Queens. Journal of Global Optimization\u00a051, 497\u2013514 (2011)","journal-title":"Journal of Global Optimization"},{"key":"6_CR33","unstructured":"Sloane, N.J.A.: The online encyclopedia of integer sequences (2012), http:\/\/oeis.org\/A000170 (retrieved)"},{"key":"6_CR34","doi-asserted-by":"crossref","unstructured":"Sosic, R., Gu, J.: Efficient local search with conflict minimization. IEEE Transactions on Knowledge and Data Engineering\u00a0(6E), 661\u2013668 (1994)","DOI":"10.1109\/69.317698"},{"key":"6_CR35","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1002\/(SICI)1098-111X(199710)12:10<739::AID-INT3>3.0.CO;2-Z","volume":"12","author":"T. Tambouratzis","year":"1997","unstructured":"Tambouratzis, T.: A Simulated Annealing Artificial Neural Network Implementation of the n-Queens Problem. Int. J. of Intelligent Systems\u00a012, 739\u2013752 (1997)","journal-title":"Int. J. of Intelligent Systems"},{"key":"6_CR36","unstructured":"Yang, X.-S.: Nature-inspired metaheuristic algorithms. Luniver Press (2010)"}],"container-title":["Studies in Computational Intelligence","Computational Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11271-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T04:53:30Z","timestamp":1746420810000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11271-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319112701","9783319112718"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11271-8_6","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2015]]}}}