{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:10:46Z","timestamp":1743138646846,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237850"},{"type":"electronic","value":"9783642237867"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23786-7_6","type":"book-chapter","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T03:58:42Z","timestamp":1314763122000},"page":"42-53","source":"Crossref","is-referenced-by-count":2,"title":["Route Finder: Efficiently Finding k Shortest Paths Using Constraint Programming"],"prefix":"10.1007","author":[{"given":"Michel P.","family":"Lefebvre","sequence":"first","affiliation":[]},{"given":"Jean-Fran\u00e7ois","family":"Puget","sequence":"additional","affiliation":[]},{"given":"Petr","family":"Vil\u00edm","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"IBM ILOG CPLEX Optimization Studio, \n                    \n                      http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex-optimization-studio\/"},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1013609600697","volume":"8","author":"S. Bistarelli","year":"2002","unstructured":"Bistarelli, S., Montanari, U.: Soft constraint logic programming and generalized shortest path problems. Journal of Heuristics\u00a08(1), 25\u201341 (2002)","journal-title":"Journal of Heuristics"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/11564751_18","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"G. Dooms","year":"2005","unstructured":"Dooms, G., Deville, Y., Dupont, P.: CP(Graph): Introducing a graph computation domain in constraint programming. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 211\u2013225. Springer, Heidelberg (2005)"},{"key":"6_CR4","volume-title":"The OPL optimization programming language","author":"P. Hentenryck Van","year":"1999","unstructured":"Van Hentenryck, P., Lustig, I., Michel, L., Puget, J.-F.: The OPL optimization programming language. MIT Press, Cambridge (1999)"},{"key":"6_CR5","unstructured":"IBM. IBM ILOG CPLEX Optimization Studio documentation. volume 8:1. IBM (2010), \n                    \n                      http:\/\/publib.boulder.ibm.com\/infocenter\/cosinfoc\/v12r2\/index.jsp"},{"key":"6_CR6","unstructured":"Lhomme, O., R\u00e9gin, J.-C.: A fast arc consistency algorithm for n-ary constraints. In: AAAI 2005 (2005)"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/978-3-540-30201-8_2","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"J.-F. Puget","year":"2004","unstructured":"Puget, J.-F.: Constraint programming next challenge: Simplicity of use. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 5\u20138. Springer, Heidelberg (2004)"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Quesada, L., Roy, P.V., Deville, Y., Collet, R.: Using dominators for solving constrained path problems. In: PADL, pp. 73\u201387 (2006)","DOI":"10.1007\/11603023_6"},{"key":"6_CR9","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 search strategies for constraint programming. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 557\u2013571. Springer, Heidelberg (2004)"},{"key":"6_CR10","unstructured":"R\u00e9gin, J.-C.: Generalized arc consistency for global cardinality constraint. In: Proceedings of the 13th National Conference on AI (AAAI\/IAAI 1996), vol.\u00a01, pp. 209\u2013215. AAAI Press \/ The MIT Press (1996)"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/978-3-540-45193-8_47","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"M. Sellmann","year":"2003","unstructured":"Sellmann, M.: Cost-based filtering for shorter path constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 694\u2013708. Springer, Heidelberg (2003)"},{"key":"6_CR12","unstructured":"Wallander, M.P., Szymanek, R., Kuchcinski, K.: CP-LP hybrid method for unique shortest path routing optimization. In: Proceedings of the International Network Optimization Conference (2007)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2011"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23786-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:56:30Z","timestamp":1558295790000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23786-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237850","9783642237867"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23786-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}