{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T22:57:27Z","timestamp":1770418647409,"version":"3.49.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T00:00:00Z","timestamp":1770336000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T00:00:00Z","timestamp":1770336000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1007\/s11704-025-41190-x","type":"journal-article","created":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T11:26:46Z","timestamp":1770377206000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["AllDiff-LS: solving alldifferent constraints with efficient local search"],"prefix":"10.1007","volume":"20","author":[{"given":"Rui","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minghao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuhang","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fuqi","family":"Jia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiyuan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feifei","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minghao","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,6]]},"reference":[{"issue":"1","key":"41190_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0004-3702(78)90029-2","volume":"10","author":"J L Lauriere","year":"1978","unstructured":"Lauriere J L. A language and a program for stating and solving combinatorial problems. Artificial Intelligence, 1978, 10(1): 29\u2013127","journal-title":"Artificial Intelligence"},{"issue":"2","key":"41190_CR2","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/PL00009274","volume":"24","author":"S R Kumar","year":"1999","unstructured":"Kumar S R, Russell A, Sundaram R. Approximating Latin square extensions. Algorithmica, 1999, 24(2): 128\u2013138","journal-title":"Algorithmica"},{"issue":"6","key":"41190_CR3","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2004.828150","volume":"50","author":"C J Colbourn","year":"2004","unstructured":"Colbourn C J, Klove T, Ling A C H. Permutation arrays for powerline communication and mutually orthogonal Latin squares. IEEE Transactions on Information Theory, 2004, 50(6): 1289\u20131291","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1\u20134","key":"41190_CR4","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1023\/B:ANOR.0000032574.01332.98","volume":"130","author":"N Barnier","year":"2004","unstructured":"Barnier N, Brisset P. Graph coloring for air traffic flow management. Annals of Operations Research, 2004, 130(1\u20134): 163\u2013178","journal-title":"Annals of Operations Research"},{"issue":"1\u20132","key":"41190_CR5","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0304-3975(99)00032-8","volume":"221","author":"K R Apt","year":"1999","unstructured":"Apt K R. The essence of constraint propagation. Theoretical Computer Science, 1999, 221(1\u20132): 179\u2013210","journal-title":"Theoretical Computer Science"},{"key":"41190_CR6","unstructured":"Van Hoeve W J. The alldifferent constraint: a survey. 2001, arXiv preprint arXiv: cs\/0105015"},{"key":"41190_CR7","first-page":"362","volume-title":"Proceedings of the 12th National Conference on Artificial Intelligence","author":"J C R\u00e9gin","year":"1994","unstructured":"R\u00e9gin J C. A filtering algorithm for constraints of difference in CSPs. In: Proceedings of the 12th National Conference on Artificial Intelligence. 1994, 362\u2013367"},{"key":"41190_CR8","first-page":"1398","volume-title":"Proceedings of the 27th International Joint Conference on Artificial Intelligence","author":"X Zhang","year":"2018","unstructured":"Zhang X, Li Q, Zhang W. A fast algorithm for generalized arc consistency of the alldifferent constraint. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence. 2018, 1398\u20131403"},{"key":"41190_CR9","first-page":"157","volume-title":"Proceedings of the 29th International Conference on International Joint Conferences on Artificial Intelligence","author":"X Zhang","year":"2021","unstructured":"Zhang X, Gao J, Lv Y, Zhang W. Early and efficient identification of useless constraint propagation for alldifferent constraints. In: Proceedings of the 29th International Conference on International Joint Conferences on Artificial Intelligence. 2021, 157"},{"key":"41190_CR10","first-page":"221","volume-title":"Proceedings of the 32nd International Joint Conference on Artificial Intelligence","author":"Z Li","year":"2023","unstructured":"Li Z, Wang Y, Li Z. A bitwise GAC algorithm for alldifferent constraints. In: Proceedings of the 32nd International Joint Conference on Artificial Intelligence. 2023, 221"},{"key":"41190_CR11","first-page":"228","volume-title":"Proceedings of the 32nd International Joint Conference on Artificial Intelligence","author":"L Zhen","year":"2023","unstructured":"Zhen L, Li Z, Li Y, Li H. Eliminating the computation of strongly connected components in generalized arc consistency algorithm for alldifferent constraint. In: Proceedings of the 32nd International Joint Conference on Artificial Intelligence. 2023, 228"},{"key":"41190_CR12","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/3-540-45322-9_5","volume-title":"Stochastic Algorithms: Foundations and Applications: International Symposium","author":"P Codognet","year":"2001","unstructured":"Codognet P, Diaz D. Yet another local search method for constraint solving. In: Steinh\u00f6fel K, ed. Stochastic Algorithms: Foundations and Applications: International Symposium. Berlin, Heidelberg: Springer, 2001, 73\u201390"},{"key":"41190_CR13","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S1574-6526(06)80009-X","volume":"2","author":"H H Hoos","year":"2006","unstructured":"Hoos H H, Tsang E. Local search methods. Foundations of Artificial Intelligence, 2006, 2: 135\u2013167","journal-title":"Foundations of Artificial Intelligence"},{"issue":"3","key":"41190_CR14","doi-asserted-by":"publisher","first-page":"173402","DOI":"10.1007\/s11704-022-1781-6","volume":"17","author":"B Liu","year":"2023","unstructured":"Liu B, Yuan M, You H. A hybrid-order local search algorithm for set k-cover problem in wireless sensor networks. Frontiers of Computer Science, 2023, 17(3): 173402","journal-title":"Frontiers of Computer Science"},{"issue":"2","key":"41190_CR15","doi-asserted-by":"publisher","first-page":"182326","DOI":"10.1007\/s11704-023-3018-8","volume":"18","author":"L Jiang","year":"2024","unstructured":"Jiang L, Ouyang D, Zhang Q, Zhang L. DeciLS-PBO: an effective local search method for pseudo-Boolean optimization. Frontiers of Computer Science, 2024, 18(2): 182326","journal-title":"Frontiers of Computer Science"},{"issue":"3","key":"41190_CR16","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10601-015-9184-z","volume":"20","author":"G Bj\u00f6rdal","year":"2015","unstructured":"Bj\u00f6rdal G, Monette J N, Flener P, Pearson J. A constraint-based local search backend for MiniZinc. Constraints, 2015, 20(3): 325\u2013345","journal-title":"Constraints"},{"key":"41190_CR17","doi-asserted-by":"publisher","first-page":"2093","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F Glover","year":"1997","unstructured":"Glover F, Laguna M. Tabu Search. New York: Springer, 1997, 2093\u20132229"},{"key":"41190_CR18","first-page":"805","volume-title":"Proceedings of the 30th AAAI Conference on Artificial Intelligence","author":"Y Wang","year":"2016","unstructured":"Wang Y, Cai S, Yin M. Two efficient local search algorithms for maximum weight clique problem. In: Proceedings of the 30th AAAI Conference on Artificial Intelligence. 2016, 805\u2013811"},{"key":"41190_CR19","first-page":"10327","volume-title":"Proceedings of the 36th AAAI Conference on Artificial Intelligence","author":"S Pan","year":"2022","unstructured":"Pan S, Wang Y, Yin M. A fast local search algorithm for the Latin square completion problem. In: Proceedings of the 36th AAAI Conference on Artificial Intelligence. 2022, 10327\u201310335"},{"issue":"2","key":"41190_CR20","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/j.cor.2012.08.021","volume":"40","author":"X Dong","year":"2013","unstructured":"Dong X, Chen P, Huang H, Nowak M. A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time. Computers & Operations Research, 2013, 40(2): 627\u2013632","journal-title":"Computers & Operations Research"},{"key":"41190_CR21","first-page":"13","volume-title":"Proceedings of the 4th Workshop on Modeling & Reformulating Constraint Satisfaction Problems","author":"H Simonis","year":"2005","unstructured":"Simonis H. Sudoku as a constraint problem. In: Proceedings of the 4th Workshop on Modeling & Reformulating Constraint Satisfaction Problems. 2005, 13\u201327"},{"issue":"7","key":"41190_CR22","first-page":"629","volume":"101","author":"I Rivin","year":"1994","unstructured":"Rivin I, Vardi I, Zimmermann P. The n-queens problem. The American Mathematical Monthly, 1994, 101(7): 629\u2013639","journal-title":"The American Mathematical Monthly"},{"key":"41190_CR23","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1145\/130069.130128","volume-title":"Proceedings of 1992 ACM\/SIGAPP Symposium on Applied Computing: Technological Challenges of the 1990\u2019s","author":"K D Crawford","year":"1992","unstructured":"Crawford K D. Solving the n-queens problem using genetic algorithms. In: Proceedings of 1992 ACM\/SIGAPP Symposium on Applied Computing: Technological Challenges of the 1990\u2019s. 1992, 1039\u20131047"},{"issue":"2","key":"41190_CR24","doi-asserted-by":"publisher","first-page":"364","DOI":"10.2307\/843642","volume":"18","author":"R Morris","year":"1974","unstructured":"Morris R, Starr D. The structure of all-interval series. Journal of Music Theory, 1974, 18(2): 364\u2013389","journal-title":"Journal of Music Theory"},{"key":"41190_CR25","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1145\/2676585.2676605","volume-title":"Proceedings of the 5th Symposium on Information and Communication Technology","author":"V H Nguyen","year":"2014","unstructured":"Nguyen V H, Son M T. Solving the all-interval series problem: SAT vs CP. In: Proceedings of the 5th Symposium on Information and Communication Technology. 2014, 65\u201374"},{"issue":"1\u20132","key":"41190_CR26","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/S0378-3758(00)00276-7","volume":"95","author":"C J Colbourn","year":"2001","unstructured":"Colbourn C J, Dinitz J H. Mutually orthogonal Latin squares: a brief survey of constructions. Journal of Statistical Planning and Inference, 2001, 95(1\u20132): 9\u201348","journal-title":"Journal of Statistical Planning and Inference"},{"issue":"2","key":"41190_CR27","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1016\/j.ejor.2005.01.048","volume":"173","author":"G Appa","year":"2006","unstructured":"Appa G, Magos D, Mourtos I. Searching for mutually orthogonal Latin squares via integer and constraint programming. European Journal of Operational Research, 2006, 173(2): 519\u2013530","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"41190_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11432-011-4343-3","volume":"56","author":"F Ma","year":"2013","unstructured":"Ma F, Zhang J. Finding orthogonal Latin squares using finite model searching tools. Science China Information Sciences, 2013, 56(3): 1\u20139","journal-title":"Science China Information Sciences"},{"key":"41190_CR29","first-page":"4053","volume-title":"Proceedings of the IEEE Congress on Evolutionary Computation (CEC)","author":"T Mantere","year":"2008","unstructured":"Mantere T, Koljonen J. Solving and analyzing Sudokus with cultural algorithms. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC). 2008, 4053\u20134060"},{"issue":"4","key":"41190_CR30","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10732-007-9012-8","volume":"13","author":"R Lewis","year":"2007","unstructured":"Lewis R. Metaheuristics can solve Sudoku puzzles. Journal of Heuristics, 2007, 13(4): 387\u2013401","journal-title":"Journal of Heuristics"},{"issue":"2","key":"41190_CR31","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/MIS.2017.29","volume":"32","author":"N Musliu","year":"2017","unstructured":"Musliu N, Winter F. A hybrid approach for the Sudoku problem: using constraint programming in iterated local search. IEEE Intelligent Systems, 2017, 32(2): 52\u201362","journal-title":"IEEE Intelligent Systems"},{"issue":"3","key":"41190_CR32","doi-asserted-by":"publisher","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. LocalSolver 1. x: a black-box local-search solver for 0\u20131 programming. 4OR, 2011, 9(3): 299\u2013316","journal-title":"4OR"},{"key":"41190_CR33","volume-title":"Choco-solver","author":"C Prud\u2019homme","year":"2019","unstructured":"Prud\u2019homme C, Fages J G, Lorca X. Choco-solver. See Choco-solver.org\/ website, 2019"},{"key":"41190_CR34","first-page":"50","volume-title":"Proceedings of SAT Competition 2020-Solver and Benchmark Descriptions","author":"A Biere","year":"2020","unstructured":"Biere A, Fazekas K, Fleury M, Heisinger M. CaDiCal, Kissat, Paracooba, Plingeling and Treengeling entering the SAT competition 2020. In: Proceedings of SAT Competition 2020-Solver and Benchmark Descriptions. 2020, 50\u201353"},{"issue":"3","key":"41190_CR35","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1109\/TG.2019.2942773","volume":"12","author":"H Lloyd","year":"2020","unstructured":"Lloyd H, Amos M. Solving Sudoku with ant colony optimization. IEEE Transactions on Games, 2020, 12(3): 302\u2013311","journal-title":"IEEE Transactions on Games"},{"key":"41190_CR36","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-1-4615-5775-3_6","volume-title":"Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization","author":"R Dorne","year":"1999","unstructured":"Dorne R, Hao J K. Tabu search for graph coloring, T-Colorings and set T-Colorings. In: Vo\u00df S, Martello S, Osman I H, Roucairol C, eds. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Boston: Springer, 1999, 77\u201392"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-025-41190-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-025-41190-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-025-41190-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T11:26:49Z","timestamp":1770377209000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-025-41190-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,6]]},"references-count":36,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["41190"],"URL":"https:\/\/doi.org\/10.1007\/s11704-025-41190-x","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,6]]},"assertion":[{"value":"6 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Jian ZHANG is an Action Editor of the journal and a co-author of this article. To minimize bias, he was excluded from all editorial decision-making related to the acceptance of this article for publication. The remaining authors declare no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"2008406"}}