{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:05:04Z","timestamp":1743066304227,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319449524"},{"type":"electronic","value":"9783319449531"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44953-1_13","type":"book-chapter","created":{"date-parts":[[2016,8,22]],"date-time":"2016-08-22T15:12:23Z","timestamp":1471878743000},"page":"189-206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Bounded Path Propagator on Directed Graphs"],"prefix":"10.1007","author":[{"given":"Diego","family":"de U\u00f1a","sequence":"first","affiliation":[]},{"given":"Graeme","family":"Gange","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Schachte","sequence":"additional","affiliation":[]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,23]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/11493853_7","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"N Beldiceanu","year":"2005","unstructured":"Beldiceanu, N., Flener, P., Lorca, X.: The tree constraint. In: Bart\u00e1k, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol. 3524, pp. 64\u201378. Springer, Heidelberg (2005)"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/11757375_5","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"N Beldiceanu","year":"2006","unstructured":"Beldiceanu, N., Katriel, I., Lorca, X.: Undirected forest constraints. In: Beck, J.C., Smith, B.M. (eds.) CPAIOR 2006. LNCS, vol. 3990, pp. 29\u201343. Springer, Heidelberg (2006)"},{"key":"13_CR3","unstructured":"Chu, G.G.: Improving combinatorial optimization. Ph.D. thesis. The University of Melbourne (2011)"},{"key":"13_CR4","unstructured":"De U\u00f1a, D.: Directed graph benchmarks (2015). http:\/\/people.eng.unimelb.edu.au\/pstuckey\/bounded_path\/bounded_path.zip"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"De U\u00f1a, D., Gange, G., Schachte, P., Stuckey, P.J.: Steiner tree problems with side constraints using constraint programming. In: Proceedings of the Thertieth AAAI Conference on Artificial Intelligence. AAAI Press (2016, to appear)","DOI":"10.1609\/aaai.v30i1.10435"},{"key":"13_CR6","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.E.: CP(Graph): introducing a graph computation domain in constraint programming. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 211\u2013225. Springer, Heidelberg (2005)"},{"issue":"4","key":"13_CR7","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01187020","volume":"11","author":"P Eades","year":"1994","unstructured":"Eades, P., Wormald, N.C.: Edge crossings in drawings of bipartite graphs. Algorithmica 11(4), 379\u2013403 (1994)","journal-title":"Algorithmica"},{"key":"13_CR8","unstructured":"Fages, J.G.: Exploitation de structures de graphe en programmation par contraintes. Ph.D. thesis. \u00c9cole de Mines de Nantes (2014)"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-642-23786-7_22","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"J-G Fages","year":"2011","unstructured":"Fages, J.-G., Lorca, X.: Revisiting the tree constraint. In: Lee, J. (ed.) Principles and Practice of Constraint Programming \u2013 CP 2011. LNCS, vol. 6876, pp. 271\u2013285. Springer, Heidelberg (2011)"},{"issue":"1","key":"13_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10601-013-9148-0","volume":"19","author":"KG Francis","year":"2014","unstructured":"Francis, K.G., Stuckey, P.J.: Explaining circuit propagation. Constraints 19(1), 1\u201329 (2014)","journal-title":"Constraints"},{"issue":"1","key":"13_CR11","first-page":"100","volume":"28","author":"JA Hartigan","year":"1979","unstructured":"Hartigan, J.A., Wong, M.A.: Algorithm as 136: A k-means clustering algorithm. J. R. Stat. Soc. Ser. C (Applied Statistics) 28(1), 100\u2013108 (1979)","journal-title":"J. R. Stat. Soc. Ser. C (Applied Statistics)"},{"key":"13_CR12","volume-title":"Data structures and algorithms","author":"JE Hopcroft","year":"1983","unstructured":"Hopcroft, J.E., Ullman, J.D., Aho, A.V.: Data structures and algorithms, vol. 175. Addison-Wesley Boston, USA (1983)"},{"issue":"1","key":"13_CR13","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/357062.357071","volume":"1","author":"T Lengauer","year":"1979","unstructured":"Lengauer, T., Tarjan, R.E.: A fast algorithm for finding dominators in a flowgraph. ACM Trans. Program. Lang. Syst. (TOPLAS) 1(1), 121\u2013141 (1979)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient sat solver. In: Proceedings of the 38th annual Design Automation Conference, pp. 530\u2013535. ACM (2001)","DOI":"10.1145\/378239.379017"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-540-74970-7_38","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"N Nethercote","year":"2007","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.R.: MiniZinc: towards a standard CP modelling language. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529\u2013543. Springer, Heidelberg (2007)"},{"issue":"3","key":"13_CR16","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s10601-008-9064-x","volume":"14","author":"O Ohrimenko","year":"2009","unstructured":"Ohrimenko, O., Stuckey, P., Codish, M.: Propagation via lazy clause generation. Constraints 14(3), 357\u2013391 (2009). http:\/\/dx.doi.org\/10.1007\/s10601-008-9064-x","journal-title":"Constraints"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/11603023_6","volume-title":"Practical Aspects of Declarative Languages","author":"L Quesada","year":"2005","unstructured":"Quesada, L., Van Roy, P., Deville, Y., Collet, R.: Using dominators for solving constrained path problems. In: Hentenryck, P. (ed.) PADL 2006. LNCS, vol. 3819, pp. 73\u201387. Springer, Heidelberg (2005)"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Rice, M.N., Tsotras, V.J.: Engineering generalized shortest path queries. In: 2013 IEEE 29th International Conference on Data Engineering (ICDE), pp. 949\u2013960. IEEE (2013)","DOI":"10.1109\/ICDE.2013.6544888"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Rice, M.N., Tsotras, V.J.: Parameterized algorithms for generalized traveling salesman problems in road networks. In: Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 114\u2013123. ACM (2013)","DOI":"10.1145\/2525314.2525342"},{"key":"13_CR20","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. 2833, pp. 694\u2013708. Springer, Heidelberg (2003)"},{"issue":"2","key":"13_CR21","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10601-006-9006-4","volume":"12","author":"M Sellmann","year":"2006","unstructured":"Sellmann, M., Gellermann, T., Wright, R.: Cost-based filtering for shorter path constraints. Constraints 12(2), 207\u2013238 (2006). http:\/\/dx.doi.org\/10.1007\/s10601-006-9006-4","journal-title":"Constraints"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Silver, D.: Cooperative pathfinding. In: AIIDE, pp. 117\u2013122 (2005)","DOI":"10.1609\/aiide.v1i1.18726"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Storandt, S.: Quick and energy-efficient routes: computing constrained shortest paths for electric vehicles. In: Proceedings of the 5th ACM SIGSPATIAL International Workshop on Computational Transportation Science, pp. 20\u201325. ACM (2012)","DOI":"10.1145\/2442942.2442947"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Storandt, S.: Route planning for bicycles-exact constrained shortest paths made practical via contraction hierarchy. In: ICAPS, vol. 4, p. 46 (2012)","DOI":"10.1609\/icaps.v22i1.13495"},{"issue":"4","key":"13_CR25","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.entcs.2009.10.020","volume":"253","author":"RD Viegas","year":"2009","unstructured":"Viegas, R.D., Azevedo, F.: Lazy constraint imposing for improving the path constraint. Electron. Notes Theor. Comput. Sci. 253(4), 113\u2013128 (2009)","journal-title":"Electron. Notes Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44953-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T20:07:31Z","timestamp":1692475651000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44953-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319449524","9783319449531"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44953-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"23 August 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Constraint Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cp2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}