{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T13:04:20Z","timestamp":1648559060859},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,2,19]],"date-time":"2010-02-19T00:00:00Z","timestamp":1266537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s10479-010-0715-0","type":"journal-article","created":{"date-parts":[[2010,2,18]],"date-time":"2010-02-18T03:40:54Z","timestamp":1266464454000},"page":"121-135","source":"Crossref","is-referenced-by-count":1,"title":["Using local search to speed up filtering algorithms for\u00a0some NP-hard constraints"],"prefix":"10.1007","volume":"184","author":[{"given":"Philippe","family":"Galinier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Hertz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandrine","family":"Paroz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilles","family":"Pesant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,2,19]]},"reference":[{"key":"715_CR1","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0012-365X(92)90646-W","volume":"100","author":"M. Biro","year":"1992","unstructured":"Biro, M., Hujter, M., & Zsolt, T. (1992). Precoloring extension 1. Interval graphs. Discrete Mathematics, 100, 267\u2013279.","journal-title":"Discrete Mathematics"},{"key":"715_CR2","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/978-3-540-68155-7_26","volume-title":"CPAIOR","author":"P. Galinier","year":"2008","unstructured":"Galinier, P., Hertz, A., Paroz, S., & Pesant, G. (2008). Using local search to speed up filtering algorithms for some NP-hard constraints. In L.\u00a0Perron & M. A.\u00a0Trick (Eds.), Lecture notes in computer science : Vol. 5015. CPAIOR (pp. 298\u2013302). Berlin: Springer."},{"key":"715_CR3","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","volume":"40","author":"M. Gendreau","year":"1994","unstructured":"Gendreau, M., Hertz, A., & Laporte, G. (1994). A tabu search heuristic for the vehicle routing problem. Management Science, 40, 1276\u20131290.","journal-title":"Management Science"},{"key":"715_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F. Glover","year":"1997","unstructured":"Glover, F., & Laguna, M. (1997). Tabu search. Boston: Kluwer Academic."},{"key":"715_CR5","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02239976","volume":"39","author":"A. Hertz","year":"1987","unstructured":"Hertz, A., & de Werra, D. (1987). Using tabu search for graph coloring. Computing, 39, 345\u2013351.","journal-title":"Computing"},{"key":"715_CR6","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0166-218X(96)00085-6","volume":"75","author":"K. Jansen","year":"1997","unstructured":"Jansen, K., & Scheffler, P. (1997). Generalized coloring for tree-like graphs. Discrete Applied Mathematics, 75, 135\u2013155.","journal-title":"Discrete Applied Mathematics"},{"key":"715_CR7","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/11757375_11","volume-title":"Proceedings of the third international conference on integration of AI and OR techniques in constraint programming for combinatorial optimisation problems (CP-AI-OR\u201906)","author":"I. Katriel","year":"2006","unstructured":"Katriel, I. (2006). Expected-case analysis for delayed filtering. In Lecture notes in computer science : Vol. 3990. Proceedings of the third international conference on integration of AI and OR techniques in constraint programming for combinatorial optimisation problems (CP-AI-OR\u201906) (pp. 119\u2013125). Berlin: Springer."},{"key":"715_CR8","first-page":"295","volume":"51","author":"M. Mahdian","year":"1999","unstructured":"Mahdian, M., & Mahmoodian, E. S. (1999). A characterization of uniquely 2-list colorable graphs. Ars Combinatoria, 51, 295\u2013305.","journal-title":"Ars Combinatoria"},{"issue":"8","key":"715_CR9","first-page":"593","volume":"26","author":"J. Peemoeller","year":"1983","unstructured":"Peemoeller, J. (1983). A correction to Br\u00e9laz\u2019s modification of Brown\u2019s coloring algorithm. Communications of the ACM, 26(8), 593\u2013597.","journal-title":"Communications of the ACM"},{"key":"715_CR10","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1007\/11889205_34","volume-title":"Proc. 12th international conference on principles and practice of constraint programming (CP06)","author":"Y. Richter","year":"2006","unstructured":"Richter, Y., Freund, A., & Naveh, Y. (2006). Generalizing alldifferent: the somedifferent constraint. In Lecture notes in computer science : Vol. 4204. Proc. 12th international conference on principles and practice of constraint programming (CP06) (pp. 468\u2013483). Berlin: Springer."},{"key":"715_CR11","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1007\/978-3-540-45193-8_46","volume-title":"Proceedings of the ninth international conference on the principles and practice of constraint programming (CP\u201903)","author":"M. Sellmann","year":"2003","unstructured":"Sellmann, M. (2003). Approximated consistency for knapsack constraints. In Lecture notes in computer science : Vol. 2833. Proceedings of the ninth international conference on the principles and practice of constraint programming (CP\u201903) (pp. 679\u2013693). Berlin: Springer."},{"key":"715_CR12","doi-asserted-by":"crossref","unstructured":"Sellmann, M., & Harvey, W. (2002). Heuristic constraint propagation. In Proceedings of the fourth international workshop on integration of AI and OR techniques in constraint programming for combinatorial optimisation problems (CP-AI-OR\u201902) 2002 (pp.\u00a0191\u2013204).","DOI":"10.1007\/3-540-46135-3_55"},{"key":"715_CR13","unstructured":"Trick, M. (1994). http:\/\/mat.gsia.cmu.edu\/COLOR\/solvers\/trick.c ."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0715-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-010-0715-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0715-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:08:00Z","timestamp":1559138880000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-010-0715-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,19]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["715"],"URL":"https:\/\/doi.org\/10.1007\/s10479-010-0715-0","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,19]]}}}