{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T04:23:01Z","timestamp":1778646181191,"version":"3.51.4"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,3,25]],"date-time":"2011-03-25T00:00:00Z","timestamp":1301011200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2011,9]]},"DOI":"10.1007\/s10288-011-0165-9","type":"journal-article","created":{"date-parts":[[2011,3,24]],"date-time":"2011-03-24T10:16:57Z","timestamp":1300961817000},"page":"299-316","source":"Crossref","is-referenced-by-count":64,"title":["LocalSolver 1.x: a black-box local-search solver for 0-1 programming"],"prefix":"10.1007","volume":"9","author":[{"given":"Thierry","family":"Benoist","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bertrand","family":"Estellon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Gardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Romain","family":"Megel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karim","family":"Nouioua","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,3,25]]},"reference":[{"key":"165_CR1","volume-title":"Local search in combinatorial optimization, wiley-interscience series in discrete mathematics and optimization","author":"E Aarts","year":"1997","unstructured":"Aarts E, Lenstra J (1997) Local search in combinatorial optimization. In: Aarts E, Lenstra J (eds) Local search in combinatorial optimization, wiley-interscience series in discrete mathematics and optimization. Wiley, Chichester"},{"key":"165_CR2","first-page":"35","volume":"3","author":"T Benoist","year":"2008","unstructured":"Benoist T, Bourreau E (2008) Fast global filtering for eternity II. Constraint Program Lett 3: 35\u201350","journal-title":"Constraint Program Lett"},{"key":"165_CR3","doi-asserted-by":"crossref","unstructured":"Benoist T, Estellon B, Gardi F, Jeanjean A (2009a) High-performance local search for solving inventory routing problems. In: St\u00fctzle T, Birattari M, Hoos H (eds) Proceedings of SLS 2009, the 2nd international workshop on engineering stochastic local search algorithms, Springer, Lecture Notes in Computer Science, vol 5752, pp 105\u2013109","DOI":"10.1007\/978-3-642-03751-1_8"},{"key":"165_CR4","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s10288-008-0092-6","volume":"7","author":"T Benoist","year":"2009","unstructured":"Benoist T, Jeanjean A, Molin P (2009b) Minimum formwork stock problem on residential buildings construction sites. 4OR-Q J Oper Res 7: 275\u2013288","journal-title":"4OR-Q J Oper Res"},{"issue":"3","key":"165_CR5","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1023\/B:HEUR.0000026900.92269.ec","volume":"10","author":"S Cahon","year":"2004","unstructured":"Cahon S, Melab N, Talbi EG (2004) ParadisEO: a framework for the reusable design of parallel and distributed metaheuristics. J Heuristics 10(3): 357\u2013380","journal-title":"J Heuristics"},{"key":"165_CR6","doi-asserted-by":"crossref","unstructured":"Caseau Y, Laburthe F, Silverstein G (1999) A meta-heuristic factory for vehicle routing problems. In: Proceedings of CP 1999, Springer, Lecture Notes in Computer Science, vol 1713, pp 144\u2013158","DOI":"10.1007\/978-3-540-48085-3_11"},{"key":"165_CR7","unstructured":"Comet Tutorial (2010) Comet 2.1 Tutorial. Dynadec Decision Technologies Inc., Providence, RI, 581 pages, http:\/\/www.dynadec.com"},{"issue":"8","key":"165_CR8","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1002\/spe.524","volume":"33","author":"L Di Gaspero","year":"2003","unstructured":"Di Gaspero L, Schaerf A (2003) EasyLocal++: an object-oriented framework for flexible design of local search algorithms. Softw Pract Exp 33(8): 733\u2013765","journal-title":"Softw Pract Exp"},{"key":"165_CR9","unstructured":"Dot\u00fa I, Van Hentenryck P (1999) Scheduling social golfers locally. In: Proceedings of CPAIOR 2005, Springer, Lecture Notes in Computer Science, vol 3524, pp 155\u2013167"},{"issue":"4","key":"165_CR10","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1051\/ro:2007003","volume":"40","author":"B Estellon","year":"2006","unstructured":"Estellon B, Gardi F, Nouioua K (2006) Large neighborhood improvements for solving car sequencing problems. RAIRO Oper Res 40(4): 355\u2013379","journal-title":"RAIRO Oper Res"},{"issue":"3","key":"165_CR11","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1016\/j.ejor.2007.04.043","volume":"191","author":"B Estellon","year":"2008","unstructured":"Estellon B, Gardi F, Nouioua K (2008) Two local search approaches for solving real-life car sequencing problems. Eur J Oper Res 191(3): 928\u2013944","journal-title":"Eur J Oper Res"},{"key":"165_CR12","doi-asserted-by":"crossref","unstructured":"Estellon B, Gardi F, Nouioua K (2009) High-performance local search for task scheduling with human resource allocation. In: Proceedings of SLS 2009, Springer, Lecture Notes in Computer Science, vol 5752, pp 1\u201315","DOI":"10.1007\/978-3-642-03751-1_1"},{"key":"165_CR13","unstructured":"Hnich B, Miguel I, Gent I, Walsh T (2009) CSPLib: a problem library for constraints. http:\/\/www.csplib.org"},{"issue":"1\/2","key":"165_CR14","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1023\/A:1009818401322","volume":"5","author":"L Michel","year":"2000","unstructured":"Michel L, Van Hentenryck P (2000) Localizer. Constraints 5(1\/2): 43\u201384","journal-title":"Constraints"},{"key":"165_CR15","doi-asserted-by":"crossref","unstructured":"Perron L, Shaw P (2004) Combining forces to solve the car sequencing problem. In: Proceedings of CPAIOR 2004, Springer, Lecture Notes in Computer Science, vol 3011, pp 225\u2013239","DOI":"10.1007\/978-3-540-24664-0_16"},{"key":"165_CR16","doi-asserted-by":"crossref","unstructured":"Perron L, Shaw P, Furnon V (2004) Propagation guided large neighborhood search. In: Proceedings of CP 2004, Springer, Lecture Notes in Computer Science, vol 3258, pp 468\u2013481","DOI":"10.1007\/978-3-540-30201-8_35"},{"issue":"3","key":"165_CR17","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1016\/j.ejor.2007.04.044","volume":"191","author":"M Prandtstetter","year":"2008","unstructured":"Prandtstetter M, Raidl G (2008) An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem. Eur J Oper Res 191(3): 1004\u20131022","journal-title":"Eur J Oper Res"},{"key":"165_CR18","first-page":"105","volume-title":"The traveling salesman problem and its variations","author":"C Rego","year":"2002","unstructured":"Rego C, Glover F (2002) Local search and metaheuristics. In: Gutin G, Punnen A (eds) The traveling salesman problem and its variations. Kluwer Academic Publishers, Dordrecht, pp 105\u2013109"},{"key":"165_CR19","unstructured":"Schaus P, Deville Y (2008) Hybridation de la programmation par contraintes et d\u2019un voisinage \u00e0 tr\u00e8s grande taille pour Eternity II. In: Proceedings of JFPC 2008, pp 115\u2013122"},{"key":"165_CR20","doi-asserted-by":"crossref","unstructured":"Schaus P, Hentenryck PV, Monette JN, Coffrin C, Michel L, Deville Y (2011) Solving steel mill slab problems with constraint-based techniques: CP, LNS, CBLS, to appear in Constraints","DOI":"10.1007\/s10601-010-9100-5"},{"key":"165_CR21","volume-title":"Cliques, coloring, and satisfiability: 2nd DIMACS implementation challenge, DIMACS series in discrete mathematics and theoretical computer science, vol 26","author":"B Selman","year":"1996","unstructured":"Selman B, Kautz H, Cohen B (1996) Local search strategies for satisfiability testing. In: Johnson D, Trick M (eds) Cliques, coloring, and satisfiability: 2nd DIMACS implementation challenge, DIMACS series in discrete mathematics and theoretical computer science, vol 26. AMS, Providence"},{"key":"165_CR22","volume-title":"Constraint-based local search","author":"P Van Hentenryck","year":"2005","unstructured":"Van Hentenryck P, Michel L (2005) Constraint-based local search. The MIT Press, Boston"},{"key":"165_CR23","unstructured":"Van Hentenryck P, Michel L (2007) Synthesis of constraint-based local search algorithms from high-level models. In: Proceedings of AAAI 2007, pp 273\u2013279"},{"key":"165_CR24","doi-asserted-by":"crossref","unstructured":"Van Hentenryck P, Michel L (2008) The steel mill slab design problem revisited. In: Proceedings of CPAIOR 2008, Lecture Notes in Computer Science, vol 5015, pp 377\u2013381","DOI":"10.1007\/978-3-540-68155-7_41"},{"issue":"2","key":"165_CR25","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1023\/A:1011203002719","volume":"20","author":"M Vasquez","year":"2001","unstructured":"Vasquez M, Hao JK (2001) A \u201clogic-constrained\u201d knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite. Comput Optim Appl 20(2): 137\u2013157","journal-title":"Comput Optim Appl"},{"key":"165_CR26","doi-asserted-by":"crossref","unstructured":"Voudouris C, Dorne R, Lesaint D, Liret A (2001) iOpt: a software toolkit for heuristic search methods. In: Proceedings of CP 2001, Lecture Notes in Computer Science, vol 2239, pp 716\u2013730","DOI":"10.1007\/3-540-45578-7_58"},{"key":"165_CR27","unstructured":"Walser J, Iyer R, Venkatasubramanyan N (1998) An integer local search method with application to capacitated production planning. In: Proceedings of AAAI 1998, pp 373\u2013379"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-011-0165-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-011-0165-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-011-0165-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T11:49:41Z","timestamp":1560080981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-011-0165-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,25]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,9]]}},"alternative-id":["165"],"URL":"https:\/\/doi.org\/10.1007\/s10288-011-0165-9","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,25]]}}}