{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:31:46Z","timestamp":1762101106588},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540232414"},{"type":"electronic","value":"9783540302018"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30201-8_35","type":"book-chapter","created":{"date-parts":[[2010,9,22]],"date-time":"2010-09-22T21:14:37Z","timestamp":1285190077000},"page":"468-481","source":"Crossref","is-referenced-by-count":34,"title":["Propagation Guided Large Neighborhood Search"],"prefix":"10.1007","author":[{"given":"Laurent","family":"Perron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Shaw","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Furnon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming - CP98","author":"P. Shaw","year":"1998","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol.\u00a01520, pp. 417\u2013431. Springer, Heidelberg (1998)"},{"key":"35_CR2","unstructured":"Bent, R., Hentenryck, P.V.: A two-stage hybrid local search for the vehicle routing problem with time windows. Technical Report CS-01-06, Brown University (2001)"},{"key":"35_CR3","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D. Applegate","year":"1991","unstructured":"Applegate, D., Cook, W.: A computational study of the job-shop scheduling problem. ORSA Journal on Computing\u00a03, 149\u2013156 (1991)","journal-title":"ORSA Journal on Computing"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J. Adams","year":"1988","unstructured":"Adams, J., Balas, E., Zawack, D.: The shifting bottleneck procedure for job shop scheduling. Management Science\u00a034, 391\u2013401 (1988)","journal-title":"Management Science"},{"key":"35_CR5","unstructured":"Caseau, Y., Laburthe, F.: Effective forget-and-extend heuristics for scheduling problems. In: Proceedings of the First International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems, CP-AI-OR 1999 (1999)"},{"key":"35_CR6","unstructured":"Palpant, M., Artigues, C., Michelon, P.: Solving the resource-constrained project scheduling problem by integrating exact resolution and local search. In: 8th International Workshop on Project Management and Scheduling PMS 2002, pp. 289\u2013292 (2002)"},{"key":"35_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/3-540-46135-3_42","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"C. Pape Le","year":"2002","unstructured":"Le Pape, C., Perron, L., R\u00e9gin, J.C., Shaw, P.: Robust and parallel solving of a network design problem. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 633\u2013648. Springer, Heidelberg (2002)"},{"key":"35_CR8","unstructured":"Palpant, M., Artigues, C., Michelon, P.: A heuristic for solving the frequency assignment problem. In: XI Latin-Iberian American Congress of Operations Research, CLAIO (2002)"},{"key":"35_CR9","unstructured":"CPLEX: ILOG CPLEX 9.0 User\u2019s Manual and Reference Manual. ILOG, S.A. (2003)"},{"key":"35_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-540-30201-8_41","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"P. Refalo","year":"2004","unstructured":"Refalo, P.: Impact based strategies for constraint programming. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 557\u2013571. Springer, Heidelberg (2004)"},{"key":"35_CR11","volume-title":"Proceeding of CP-AI-OR 2004","author":"L. Perron","year":"2004","unstructured":"Perron, L.: Combining forces to solve the car sequencing problem. In: Proceeding of CP-AI-OR 2004, Springer, Heidelberg (2004)"},{"key":"35_CR12","unstructured":"Chabrier, A., Danna, E., Le Pape, C., Perron, L.: Solving a network design problem. To appear in Annals of Operations Research, Special Issue following CP-AIOR 2002 (2003)"},{"key":"35_CR13","unstructured":"Perron, L.: Fast restart policies and large neighborhood search. In: Proceedings of CPAIOR 2003 (2003)"},{"key":"35_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1007\/978-3-540-45193-8_59","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"E. Danna","year":"2003","unstructured":"Danna, E., Perron, L.: Structured vs. unstructured large neighborhood search: A case study on job-shop scheduling problems with earliness and tardiness costs. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 817\u2013821. Springer, Heidelberg (2003)"},{"key":"35_CR15","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/582419.582430","volume-title":"Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications","author":"L. Michel","year":"2002","unstructured":"Michel, L., Hentenryck, P.V.: A constraint-based architecture for local search. In: Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, pp. 83\u2013100. ACM Press, New York (2002)"},{"key":"35_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/3-540-36605-9_23","volume-title":"Applications of Evolutionary Computing","author":"J. Gottlieb","year":"2003","unstructured":"Gottlieb, J., Puchta, M., Solnon, C.: A study of greedy, local search and ant colony optimization approaches for car sequencing problems. In: Raidl, G.R., Cagnoni, S., Cardalda, J.J.R., Corne, D.W., Gottlieb, J., Guillot, A., Hart, E., Johnson, C.G., Marchiori, E., Meyer, J.-A., Middendorf, M. (eds.) EvoIASP 2003, EvoWorkshops 2003, EvoSTIM 2003, EvoROB\/EvoRobot 2003, EvoCOP 2003, EvoBIO 2003, and EvoMUSART 2003. LNCS, vol.\u00a02611, pp. 246\u2013257. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2004"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30201-8_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T22:55:04Z","timestamp":1558306504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30201-8_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232414","9783540302018"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30201-8_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}