{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:41:54Z","timestamp":1725514914916},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540723967"},{"type":"electronic","value":"9783540723974"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72397-4_11","type":"book-chapter","created":{"date-parts":[[2007,6,22]],"date-time":"2007-06-22T19:56:32Z","timestamp":1182542192000},"page":"141-154","source":"Crossref","is-referenced-by-count":2,"title":["Necessary Condition for Path Partitioning Constraints"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Beldiceanu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xavier","family":"Lorca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"11_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0020-0190(90)90064-5","volume":"35","author":"S.R. Arikati","year":"1990","unstructured":"Arikati, S.R., Rangan, C.P.: Linear algorithm for optimal path cover problem on interval graphs. Inf. Process. Lett.\u00a035(3), 149\u2013153 (1990)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"11_CR2","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1287\/opre.12.2.300","volume":"12","author":"M.L. Balinski","year":"1964","unstructured":"Balinski, M.L., Quandt, R.E.: On an Integer Program for Delivery Problem. Operations Research\u00a012(2), 300\u2013304 (1964)","journal-title":"Operations Research"},{"issue":"12","key":"11_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","volume":"20","author":"N. Beldiceanu","year":"1994","unstructured":"Beldiceanu, N., Contejean, E.: Introducing global constraint in CHIP. Mathl. Comput. Modelling\u00a020(12), 97\u2013123 (1994)","journal-title":"Mathl. Comput. Modelling"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.\u00a03524, pp. 64\u201378. Springer, Heidelberg (2005)"},{"key":"11_CR5","unstructured":"Beldiceanu, N., Flener, P., Lorca, X.: Combining tree partitioning, precedence, incomparability, and degree constraints, with an application to phylogenetic and ordered-path problems. Technical Report 2006-020, Department of Information Technology, Uppsala University, Sweden (April 2006)"},{"key":"11_CR6","volume-title":"Graphes et Hypergraphes","author":"C. Berge","year":"1970","unstructured":"Berge, C.: Graphes et Hypergraphes. Dunod, Paris (1970)"},{"key":"11_CR7","unstructured":"Cambazard, H., Bourreau, E.: Conception d\u2019une contrainte globale de chemin (In French). In: JNPC\u201904, pp. 107\u2013120 (2004)"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R.P. Dilworth","year":"1950","unstructured":"Dilworth, R.P.: A decomposition theorem for partially ordered sets. Annals of Mathematics\u00a051, 161\u2013166 (1950)","journal-title":"Annals of Mathematics"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S. Fortune","year":"1980","unstructured":"Fortune, S., Hopcroft, J.E., Wyllie, J.: The directed subgraph homeomorphism problem. Theor. Comput. Sci.\u00a010, 111\u2013121 (1980)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1007\/11889205_55","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"L.G. Kaya","year":"2006","unstructured":"Kaya, L.G., Hooker, J.N.: A filter for the circuit constraint. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 706\u2013710. Springer, Heidelberg (2006)"},{"issue":"1","key":"11_CR11","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.\u00a01(1), 121\u2013141 (1979)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"11_CR12","unstructured":"Prosser, P., Unsworth, C.: Rooted tree and spanning tree constraints. Technical Report cppod-13-2006, CP Pod research group (May 2006)"},{"key":"11_CR13","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: Van Hentenryck, P. (ed.) PADL 2006. LNCS, vol.\u00a03819, pp. 73\u201387. Springer, Heidelberg (2005)"},{"key":"11_CR14","volume-title":"Combinatorial Optimization","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization. Springer, Berlin (2003)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"issue":"3","key":"11_CR16","doi-asserted-by":"publisher","first-page":"2147","DOI":"10.1016\/S0304-3975(02)00577-7","volume":"290","author":"G. Steiner","year":"2003","unstructured":"Steiner, G.: On the k-path partition of graphs. Theor. Comput. Sci.\u00a0290(3), 2147\u20132155 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/net.3230040204","volume":"4","author":"J.W. Suurballe","year":"1974","unstructured":"Suurballe, J.W.: Disjoint Paths in a Network. Networks\u00a04, 125\u2013145 (1974)","journal-title":"Networks"},{"issue":"1","key":"11_CR18","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0166-218X(93)E0177-Z","volume":"61","author":"J. Vygen","year":"1995","unstructured":"Vygen, J.: NP-completeness of some edge-disjoint paths problems. Discrete Appl. Math.\u00a061(1), 83\u201390 (1995)","journal-title":"Discrete Appl. Math."},{"issue":"6","key":"11_CR19","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0020-0190(94)00158-8","volume":"52","author":"J.-H. Yan","year":"1994","unstructured":"Yan, J.-H., Chang, G.J.: The path-partition problem in block graphs. Inf. Process. Lett.\u00a052(6), 317\u2013322 (1994)","journal-title":"Inf. Process. Lett."}],"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-540-72397-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T11:53:36Z","timestamp":1550404416000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72397-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540723967","9783540723974"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72397-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}