{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T17:30:54Z","timestamp":1770485454231,"version":"3.49.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,3,7]],"date-time":"2015-03-07T00:00:00Z","timestamp":1425686400000},"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,7]]},"DOI":"10.1007\/s10601-015-9184-z","type":"journal-article","created":{"date-parts":[[2015,3,6]],"date-time":"2015-03-06T03:51:13Z","timestamp":1425613873000},"page":"325-345","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["A constraint-based local search backend for MiniZinc"],"prefix":"10.1007","volume":"20","author":[{"given":"Gustav","family":"Bj\u00f6rdal","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5734-5881","authenticated-orcid":false,"given":"Jean-No\u00ebl","family":"Monette","sequence":"additional","affiliation":[]},{"given":"Pierre","family":"Flener","sequence":"additional","affiliation":[]},{"given":"Justin","family":"Pearson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,7]]},"reference":[{"issue":"1","key":"9184_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T. (2009). SCIP: Solving constraint integer programs. Mathematical Programming Computation, 1(1), 1\u201341.","journal-title":"Mathematical Programming Computation"},{"key":"9184_CR2","doi-asserted-by":"crossref","unstructured":"Akg\u00fcn, O., Frisch, A.M., Gent, I.P., Hussain, B.S., Jefferson, C., Kotthoff, L., Miguel, I., & Nightingale, P. (2013). Automated symmetry breaking and model selection in CONJURE. In C. Schulte (Ed.) CP 2013, LNCS, (Vol. 8124 pp. 107\u2013116): Springer.","DOI":"10.1007\/978-3-642-40627-0_11"},{"key":"9184_CR3","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1017\/S1471068414000179","volume":"14","author":"R Amadini","year":"2014","unstructured":"Amadini, R., Gabbrielli, M., & Mauro, J. (2014). Sunny: a lazy portfolio approach for constraint solving. Theory and Practice of Logic Programming, 14, 509\u2013524.","journal-title":"Theory and Practice of Logic Programming"},{"issue":"1","key":"9184_CR4","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10601-006-9010-8","volume":"12","author":"N Beldiceanu","year":"2007","unstructured":"Beldiceanu, N., Carlsson, M., Demassey, S., & Petit, T. (2007). Global constraint catalogue: Past, present, and future. Constraints, 12(1), 21\u201362. The catalogue is at http:\/\/sofdem.github.io\/gccat .","journal-title":"Constraints"},{"issue":"3","key":"9184_CR5","first-page":"299","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. A Quarterly Journal of Operations Research, 9(3), 299\u2013316.","journal-title":"A Quarterly Journal of Operations Research"},{"key":"9184_CR6","unstructured":"Bj\u00f6rdal, G. (2014). The first constraint-based local search backend for MiniZinc. Bachelor Thesis in Computer Science, Report IT 14 066, Faculty of Science and Technology, Uppsala University, Sweden. http:\/\/urn.kb.se\/resolve?urn=urn:nbn:se:uu:diva-234847 ."},{"key":"9184_CR7","unstructured":"Bofill, M., Palah\u00ed, M., Suy, J., & Villaret, M. fzn2smt, a compiler from the FlatZinc language to the standard SMT-LIB language. http:\/\/ima.udg.edu\/Recerca\/lap\/fzn2smt\/ ."},{"key":"9184_CR8","unstructured":"Codognet, P., & Diaz, D. (2001). Yet another local search method for constraint solving. In K. Steinh\u00f6fel (Ed.) SAGA 2001, First International Symposium on Stochastic Algorithms: Foundations and Applications, LNCS, (Vol. 2264 pp. 73\u201390): Springer."},{"key":"9184_CR9","unstructured":"De Landtsheer, R. (2012). Oscar.cbls: a constraint-based local search engine. https:\/\/bitbucket.org\/oscarlib\/oscar\/downloads\/Oscar.cbls.pdf ."},{"key":"9184_CR10","unstructured":"Dot\u00fa, I., & Van Hentenryck, P. (2005). Scheduling social golfers locally. In R. Bart\u00e1k, & M. Milano (Eds.) CP-AI-OR 2005, LNCS, (Vol. 3524 pp. 155\u2013167): Springer."},{"key":"9184_CR11","doi-asserted-by":"crossref","unstructured":"Elsayed, S.A.M., & Michel, L. (2011). Synthesis of search algorithms from high-level CP models. In J. Lee (Ed.) CP 2011, LNCS, (Vol. 6876 pp. 256\u2013270): Springer.","DOI":"10.1007\/978-3-642-23786-7_21"},{"key":"9184_CR12","doi-asserted-by":"crossref","unstructured":"Feydy, T., Somogyi, Z., & Stuckey, P. (2011). Half-reification and flattening. In J. Lee (Ed.) CP 2011, LNCS, (Vol. 6876 pp. 286\u2013301): Springer.","DOI":"10.1007\/978-3-642-23786-7_23"},{"key":"9184_CR13","doi-asserted-by":"crossref","unstructured":"Fontaine, D., Michel, L., & Van Hentenryck, P. (2013). Model combinators for hybrid optimization. In C. Schulte (Ed.) CP 2013, LNCS, (Vol. 8124 pp. 299\u2013314): Springer.","DOI":"10.1007\/978-3-642-40627-0_25"},{"key":"9184_CR14","unstructured":"Frisch, A.M., Grum, M., Jefferson, C., Martinez Hernandez, B., & Miguel, I. (2007). The design of ESSENCE: A constraint language for specifying combinatorial problems. In M. Veloso (Ed.), IJCAI 2007 (pp. 80\u201387). AAAI Press."},{"key":"9184_CR15","unstructured":"Fujiwara, T. (2014). iZ based solver for MiniZinc Challenge. http:\/\/www.minizinc.org\/challenge2014\/description_izplus.txt ."},{"key":"9184_CR16","unstructured":"Gecode Team. Gecode\/FlatZinc. http:\/\/www.gecode.org\/flatzinc.html ."},{"key":"9184_CR17","doi-asserted-by":"crossref","unstructured":"Glover, F. (1989). Tabu Search Part I. ORSA Journal on Computing, 1(3), 190\u2013206.","DOI":"10.1287\/ijoc.1.3.190"},{"key":"9184_CR18","doi-asserted-by":"crossref","unstructured":"Y. Hamadi, E. Monfroy, & F. Saubion (Eds.) (2012). Autonomous Search: Springer.","DOI":"10.1007\/978-3-642-21434-9"},{"key":"9184_CR19","doi-asserted-by":"crossref","unstructured":"He, J., Flener, P., & Pearson, J. (2012). Solution neighbourhoods for constraint-directed local search. In S. Bistarelli, E. Monfroy, & B. O\u2019Sullivan (Eds.) SAC\/CSP 2012. (pp. 74\u201379): ACM Press.","DOI":"10.1145\/2245276.2245294"},{"key":"9184_CR20","unstructured":"Hoos, H.H. (2012). Automated algorithm configuration and parameter tuning. In Y. Hamadi, E. Monfroy, & F. Saubion (Eds.) Autonomous Search. (pp. 37\u201371): Springer."},{"key":"9184_CR21","unstructured":"Hoos, H.H., & St\u00fctzle, T. (2004). Stochastic Local Search: Foundations & Applications: Elsevier\/Morgan Kaufmann."},{"key":"9184_CR22","doi-asserted-by":"crossref","unstructured":"Karp, R.M. (1972). Reducibility among combinatorial problems. In R.E. Miller, & J.W. Thatcher (Eds.) Complexity of Computer Computations. (pp. 85\u2013103): Plenum Press.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"9184_CR23","doi-asserted-by":"crossref","unstructured":"Monette, J.N., Deville, Y., & Van Hentenryck, P. (2009). Aeon: Synthesizing scheduling algorithms from high-level models. In J.W. Chinneck, B. Kristjansson, & M.J. Saltzman (Eds.) Operations Research and Cyber-Infrastructure, Operations Research\/Computer Science Interfaces, (Vol. 47 pp. 43\u201359): Springer.","DOI":"10.1007\/978-0-387-88843-9_3"},{"key":"9184_CR24","unstructured":"Nethercote, N. Converting MiniZinc to FlatZinc. http:\/\/www.minizinc.org\/downloads\/doc-1.6\/mzn2fzn.pdf ."},{"key":"9184_CR25","doi-asserted-by":"crossref","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., & Tack, G. (2007). MiniZinc: Towards a standard CP modelling language. In C. Bessi\u00e8re (Ed.), CP 2007, LNCS (Vol. 4741, pp. 529\u2013543). Springer. http:\/\/www.minizinc.org\/ .","DOI":"10.1007\/978-3-540-74970-7_38"},{"key":"9184_CR26","doi-asserted-by":"crossref","unstructured":"Newton, M.H., Pham, D.N., Sattar, A., & Maher, M. (2011). Kangaroo: An efficient constraint-based local search system using lazy propagation. In J. Lee (Ed.) CP 2011, LNCS, (Vol. 6876 pp. 645\u2013659): Springer.","DOI":"10.1007\/978-3-642-23786-7_49"},{"key":"9184_CR27","doi-asserted-by":"crossref","unstructured":"Nightingale, P., Akg\u00fcn, O., Gent, I.P., Jefferson, C., & Miguel, I. (2014). Automatically improving constraint models in Savile Row through associative-commutative common subexpression elimination. In B. O\u2019Sullivan (Ed.) CP 2014, LNCS, (Vol. 8656 pp. 590\u2013605): Springer.","DOI":"10.1007\/978-3-319-10428-7_43"},{"issue":"6","key":"9184_CR28","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E Nowicki","year":"1996","unstructured":"Nowicki, E., & Smutnicki, C. (1996). A fast taboo search algorithm for the job shop problem. Management Science, 42(6), 797\u2013813.","journal-title":"Management Science"},{"key":"9184_CR29","unstructured":"Opturion Pty Ltd. Opturion CPX. http:\/\/www.opturion.com\/cpx ."},{"key":"9184_CR30","unstructured":"OR Team at Google. OR-Tools. https:\/\/code.google.com\/p\/or-tools\/ ."},{"key":"9184_CR31","unstructured":"OscaR Team (2012). OscaR: Scala in OR. https:\/\/bitbucket.org\/oscarlib\/oscar ."},{"key":"9184_CR32","unstructured":"Parr, T.J. (2007). The Definitive ANTLR Reference: Building Domain-Specific Languages: The Pragmatic Bookshelf."},{"key":"9184_CR33","unstructured":"Prestwich, S.D. (2002). Supersymmetric modeling for local search. In P. Flener, & J. Pearson (Eds.) SymCon 2002. http:\/\/www.it.uu.se\/research\/group\/astra\/SymCon02 ."},{"issue":"3","key":"9184_CR34","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10601-010-9093-0","volume":"15","author":"PJ Stuckey","year":"2010","unstructured":"Stuckey, P.J., Becket, R., & Fischer, J. (2010). Philosophy of the MiniZinc challenge. Constraints, 15(3), 307\u2013316.","journal-title":"Constraints"},{"issue":"2","key":"9184_CR35","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1609\/aimag.v35i2.2539","volume":"35","author":"PJ Stuckey","year":"2014","unstructured":"Stuckey, P.J., Feydy, T., Schutt, A., Tack, G., & Fischer, J. (2014). The MiniZinc challenge 2008\u20132013. AI Magazine, 35(2), 55\u201360.","journal-title":"AI Magazine"},{"key":"9184_CR36","unstructured":"Van Hentenryck, P. (1999). The OPL Optimization Programming Language: The MIT Press."},{"key":"9184_CR37","doi-asserted-by":"crossref","unstructured":"Van Hentenryck, P., & Michel, L. (2003) In F. Rossi (Ed.), Control abstractions for local search (Vol. 2833, pp. 65\u201380): Springer.","DOI":"10.1007\/978-3-540-45193-8_5"},{"key":"9184_CR38","doi-asserted-by":"crossref","unstructured":"Van Hentenryck, P., & Michel, L. (2004). Scheduling abstractions for local search. In J.C. R\u00e9gin, & M. Rueher (Eds.) CP-AI-OR 2004, LNCS, (Vol. 3011 pp. 319\u2013334): Springer.","DOI":"10.1007\/978-3-540-24664-0_22"},{"key":"9184_CR39","unstructured":"Van Hentenryck, P., & Michel, L. (2007). Synthesis of constraint-based local search algorithms from high-level models. In A. Howe, & R.C. Holte (Eds.) AAAI 2007. (pp. 273\u2013278): AAAI Press."},{"key":"9184_CR40","unstructured":"Van Hentenryck, P., & Michel, L. (2009). Constraint-Based Local Search: The MIT Press."},{"key":"9184_CR41","doi-asserted-by":"crossref","unstructured":"Van Hentenryck, P., Michel, L., & Liu, L. (2004). Constraint-based combinators for local search. In M. Wallace (Ed.) CP 2004, LNCS, (Vol. 3258 pp. 47\u201361): Springer.","DOI":"10.1007\/978-3-540-30201-8_7"},{"issue":"2","key":"9184_CR42","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.1090.0733","volume":"58","author":"TH Yunes","year":"2010","unstructured":"Yunes, T.H., Aron, I.D., & Hooker, J.N. (2010). An integrated solver for optimization problems. Operations Research, 58(2), 342\u2013356.","journal-title":"Operations Research"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-015-9184-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-015-9184-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-015-9184-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T14:27:52Z","timestamp":1566397672000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-015-9184-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,7]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["9184"],"URL":"https:\/\/doi.org\/10.1007\/s10601-015-9184-z","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,7]]}}}