{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:39:59Z","timestamp":1725557999401},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135194"},{"type":"electronic","value":"9783642135200"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13520-0_7","type":"book-chapter","created":{"date-parts":[[2010,6,12]],"date-time":"2010-06-12T16:10:33Z","timestamp":1276359033000},"page":"45-50","source":"Crossref","is-referenced-by-count":0,"title":["Characterization and Automation of Matching-Based Neighborhoods"],"prefix":"10.1007","author":[{"given":"Thierry","family":"Benoist","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-3","key":"7_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"R.K. Ahuja","year":"2002","unstructured":"Ahuja, R.K., Ergun, O., Orlin, J.B., Punnen, A.P.: A survey of very large-scale neighborhood search techniques. Discrete Appl. Math.\u00a0123(1-3), 75 (2002)","journal-title":"Discrete Appl. Math."},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10878-007-9075-3","volume":"15","author":"E. Angel","year":"2008","unstructured":"Angel, E., Bampis, E., Pascual, F.: An exponential (matching based) neighborhood for the vehicle routing problem. Journal of Combinatorial Optimization\u00a015, 179\u2013190 (2008)","journal-title":"Journal of Combinatorial Optimization"},{"key":"7_CR3","unstructured":"Benoist, T.: Autonomous Local Search with Very Large-Scale Neighborhoods (manuscript in preparation)"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Bozejko, W., Wodecki, M.: A Fast Parallel Dynasearch Algorithm for Some Scheduling Problems. Parallel Computing in Electrical Engineering, 275\u2013280 (2006)","DOI":"10.1109\/PARELEC.2006.3"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-540-68155-7_7","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"H. Cambazard","year":"2008","unstructured":"Cambazard, H., Horan, J., O\u2019Mahony, E., O\u2019Sullivan, B.: Fast and Scalable Domino Portrait Generation. In: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol.\u00a05015, pp. 51\u201365. Springer, Heidelberg (2008)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/3-540-61680-2_67","volume-title":"Algorithms - ESA \u201996","author":"B.V. Cherkassky","year":"1996","unstructured":"Cherkassky, B.V., Goldberg, A.V.: Negative-Cycle Detection Algorithms. In: D\u00edaz, J. (ed.) ESA 1996. LNCS, vol.\u00a01136, pp. 349\u2013363. Springer, Heidelberg (1996)"},{"issue":"4","key":"7_CR7","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1051\/ro:2007003","volume":"40","author":"B. Estellon","year":"2006","unstructured":"Estellon, B., Gardi, F., Nouioua, K.: Large neighborhood improvements for solving car sequencing problems. RAIRO Operations Research\u00a040(4), 355\u2013379 (2006)","journal-title":"RAIRO Operations Research"},{"key":"7_CR8","unstructured":"Hamadi, Y., Monfroy, E., Saubion, F.: What is Autonomous Search? Microsoft research report. MSR-TR-2008-80 (2008)"},{"issue":"4","key":"7_CR9","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s002910050098","volume":"21","author":"J. Hurink","year":"1999","unstructured":"Hurink, J.: An exponential neighborhood for a one-machine batching problem. OR Spectrum\u00a021(4), 461\u2013476 (1999)","journal-title":"OR Spectrum"},{"key":"7_CR10","unstructured":"Mouthuy, S., Deville, Y., Van Hentenryck, P.: Toward a Generic Comet Implementation of Very Large-Scale Neighborhoods. In: 22nd National Conference of the Belgian Operations Research Society, Brussels, January 16-18 (2008)"},{"key":"7_CR11","unstructured":"Shaus, P., Deville, Y.: Hybridization of CP and VLNS for Eternity II. In: JFPC 2008 Quatri\u00e8me Journ\u00e9es Francophones de Programmation par Contraintes, Nantes (2008)"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1007\/3-540-45578-7_58","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"C. Voudouris","year":"2001","unstructured":"Voudouris, C., Dorne, R., Lesaint, D., Liret, A.: iOpt: A Software Toolkit for Heuristic Search Methods. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 716\u2013719. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13520-0_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:06:10Z","timestamp":1619784370000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13520-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135194","9783642135200"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13520-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}