{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:35:56Z","timestamp":1743111356326,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540218364"},{"type":"electronic","value":"9783540246640"}],"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-24664-0_12","type":"book-chapter","created":{"date-parts":[[2010,10,23]],"date-time":"2010-10-23T14:59:59Z","timestamp":1287845999000},"page":"173-189","source":"Crossref","is-referenced-by-count":6,"title":["Local Probing Applied to Network Routing"],"prefix":"10.1007","author":[{"given":"Olli","family":"Kamarainen","sequence":"first","affiliation":[]},{"given":"Hani","family":"El Sakkout","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1023\/A:1021897321637","volume":"118","author":"F. Ajili","year":"2003","unstructured":"Ajili, F., Sakkout, H.E.: A probe based algorithm for piecewise linear optimization in scheduling. Annals of Operations Research\u00a0118, 35\u201348 (2003)","journal-title":"Annals of Operations Research"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1023\/A:1021849405707","volume":"118","author":"C. Beck","year":"2003","unstructured":"Beck, C., Refalo, P.: A hybrid approach to scheduling with earliness and tardiness costs. Annals of Operations Research\u00a0118, 49\u201371 (2003)","journal-title":"Annals of Operations Research"},{"key":"12_CR3","unstructured":"Benoist, T., Bourreau, E.: Improving global constraints support by local search. In: Proc. of CoSolv 2003 (2003)"},{"key":"12_CR4","unstructured":"Caseau, Y., Laburthe, F.: Disjunctive scheduling with task intervals. Technical Report LIENS-95-25, \u00c9cole Normale Sup\u00e9rieure, Paris, France (1995)"},{"issue":"3","key":"12_CR5","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1023\/A:1009661600931","volume":"5","author":"Y. Caseau","year":"1999","unstructured":"Caseau, Y., Laburthe, F.: Heuristics for large constrained vehicle routing problems. Journal of Heuristics\u00a05(3), 281\u2013303 (1999)","journal-title":"Journal of Heuristics"},{"issue":"4","key":"12_CR6","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1023\/A:1009856210543","volume":"5","author":"H.E. Sakkout","year":"2000","unstructured":"Sakkout, H.E., Wallace, M.: Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints\u00a05(4), 359\u2013388 (2000)","journal-title":"Constraints"},{"key":"12_CR7","unstructured":"Focacci, F., Shaw, P.: Pruning sub-optimal search branches using local search. In: Proc. of CP-AI-OR 2002 (2002)"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1023\/A:1013195004424","volume":"104","author":"J.N. Hooker","year":"2001","unstructured":"Hooker, J.N., Kim, H.-J., Ottosson, G.: A declarative modeling framework that integrates solution methods. Annals of Operations Research\u00a0104, 141\u2013161 (2001)","journal-title":"Annals of Operations Research"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0004-3702(02)00221-7","volume":"139","author":"N. Jussien","year":"2002","unstructured":"Jussien, N., Lhomme, O.: Local search with constraint propagation and conflictbased heuristics. Artificial Intelligence\u00a0139, 21\u201345 (2002)","journal-title":"Artificial Intelligence"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-46135-3_11","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"O. Kamarainen","year":"2002","unstructured":"Kamarainen, O., Sakkout, H.E.: Local probing applied to scheduling. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 155\u2013171. Springer, Heidelberg (2002)"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt Jr., C., Vecchi, M.: Optimization by simulated annealing. Science\u00a0220, 671\u2013680 (1983)","journal-title":"Science"},{"key":"12_CR12","unstructured":"Liatsos, V., Novello, S., Sakkout, H.E.: A probe backtrack search algorithm for network routing. In: Proc. of CoSolv (2003)"},{"key":"12_CR13","unstructured":"Loudni, S., David, P., Boizumault, P.: On-line resources allocation for ATM networks with rerouting. In: Proc. of CP-AI-OR 2003 (2003)"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1023\/A:1018999721141","volume":"22","author":"B. Mazure","year":"1998","unstructured":"Mazure, B., Sa\u00efs, L., Gr\u00e9goire, \u00c9.: Boosting complete techniques thanks to local search. Annals of Mathematics and Artificial Intelligence\u00a022, 319\u2013331 (1998)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/3-540-45349-0_25","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"S. Prestwich","year":"2000","unstructured":"Prestwich, S.: A hybrid search architecture applied to hard random 3-sat and low-autocorrelation binary sequences. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 337\u2013352. Springer, Heidelberg (2000)"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1023\/A:1013661617536","volume":"8","author":"L. Rousseau","year":"2002","unstructured":"Rousseau, L., Gendreau, M., Pesant, G.: Using constraint-based operators to solve the vehicle routing problem with time windows. J. Heuristics\u00a08, 45\u201358 (2002)","journal-title":"J. Heuristics"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"M. Sellmann and W. Harvey. Heuristic constraint propagation: Using local search for incomplete pruning and domain filtering of redundant constraints for the social golfer problem. In Proc. of CP-AI-OR\u201902, 2002.","DOI":"10.1007\/3-540-46135-3_55"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"P. Shaw. Using constraint programming and local search methods to solve vehicle routing problems. In Proc. of CP\u201998, pages 417\u2013431, 1998.","DOI":"10.1007\/3-540-49481-2_30"},{"key":"12_CR19","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1023\/A:1014450507312","volume":"34","author":"M. Wallace","year":"2002","unstructured":"M. Wallace and J. Schimpf. Finding the right hybrid algorithm - a combinatorial meta-problem. Annals of Mathematics and Artificial Intelligence, 34:259\u2013269, 2002.","journal-title":"Annals of Mathematics and Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24664-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T23:53:48Z","timestamp":1675900428000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-24664-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540218364","9783540246640"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24664-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}