{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:40:06Z","timestamp":1725558006969},"publisher-location":"Berlin, Heidelberg","reference-count":10,"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_29","type":"book-chapter","created":{"date-parts":[[2010,6,12]],"date-time":"2010-06-12T16:10:33Z","timestamp":1276359033000},"page":"267-281","source":"Crossref","is-referenced-by-count":7,"title":["Constraint-Based Local Search for Constrained Optimum Paths Problems"],"prefix":"10.1007","author":[{"given":"Quang Dung","family":"Pham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yves","family":"Deville","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Van Hentenryck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, New Jersey (1993)"},{"key":"29_CR2","unstructured":"Beasley, J.E.: Or-library, \n                  \n                    http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/info.html"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/net.3230190402","volume":"19","author":"J.E. Beasley","year":"1989","unstructured":"Beasley, J.E., Christofides, N.: An algorithm for the resource constrained shortest path problem. Network\u00a019, 379\u2013394 (1989)","journal-title":"Network"},{"issue":"3","key":"29_CR4","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10852-007-9060-y","volume":"6","author":"M. Blesa","year":"2007","unstructured":"Blesa, M., Blum, C.: Finding edge-disjoint paths in networks: An ant colony optimization algorithm. Journal of Mathematical Modelling and Algorithms\u00a06(3), 361\u2013391 (2007)","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"key":"29_CR5","unstructured":"Carlyle, W.M., Wood, R.K.: Lagrangian relaxation and enumeration for solving constrained shortest-path problems. In: Proceedings of the 38th Annual ORSNZ Conference (2003)"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1002\/net.10073","volume":"41","author":"J.C.N. Cl\u00edmaco","year":"2003","unstructured":"Cl\u00edmaco, J.C.N., Craveirinha, J.M.F., Pascoal, M.M.B.: A bicriterion approach for routing problems in multimedia networks. Network\u00a041, 206\u2013220 (2003)","journal-title":"Network"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1002\/net.10090","volume":"42","author":"I. Dumitrescu","year":"2003","unstructured":"Dumitrescu, I., Boland, N.: Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem. Networks\u00a042, 135\u2013153 (2003)","journal-title":"Networks"},{"key":"29_CR8","unstructured":"Pham, Q.D., Deville, Y., Van Hentenryck, P.: Ls(graph & tree): A local search framework for constraint optimization on graphs and trees. In: Proceedings of the 24th Annual ACM Symposium on Applied Computing (SAC 2009) (2009)"},{"issue":"7","key":"29_CR9","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1080\/07408170500436898","volume":"38","author":"K. Smilowitz","year":"2006","unstructured":"Smilowitz, K.: Multi-resource routing with flexible tasks: an application in drayage operation. IIE Transactions\u00a038(7), 555\u2013568 (2006)","journal-title":"IIE Transactions"},{"key":"29_CR10","volume-title":"Constraint-based local search","author":"P. Hentenryck Van","year":"2005","unstructured":"Van Hentenryck, P., Michel, L.: Constraint-based local search. The MIT Press, London (2005)"}],"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_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,9]],"date-time":"2018-10-09T00:03:20Z","timestamp":1539043400000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13520-0_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135194","9783642135200"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13520-0_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}