{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:32:31Z","timestamp":1725888751476},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319597751"},{"type":"electronic","value":"9783319597768"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-59776-8_15","type":"book-chapter","created":{"date-parts":[[2017,5,30]],"date-time":"2017-05-30T09:26:33Z","timestamp":1496136393000},"page":"185-201","source":"Crossref","is-referenced-by-count":0,"title":["The Weighted Arborescence Constraint"],"prefix":"10.1007","author":[{"given":"Vinasetan Ratheil","family":"Houndji","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Schaus","sequence":"additional","affiliation":[]},{"given":"Mahouton Norbert","family":"Hounkonnou","sequence":"additional","affiliation":[]},{"given":"Laurence","family":"Wolsey","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,31]]},"reference":[{"key":"15_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). doi:\n10.1007\/11493853_7"},{"key":"15_CR2","first-page":"29","volume":"1","author":"F Bock","year":"1971","unstructured":"Bock, F.: An algorithm to construct a minimum directed spanning tree in a directed network. Dev. Oper. Res. 1, 29\u201344 (1971)","journal-title":"Dev. Oper. Res."},{"key":"15_CR3","first-page":"1396","volume":"14","author":"YJ Chu","year":"1965","unstructured":"Chu, Y.J., Liu, T.H.: On the shortest arborescence of a directed graph. Sci. Sin. Ser. A 14, 1396\u20131400 (1965)","journal-title":"Sci. Sin. Ser. A"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/11889205_13","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"G Dooms","year":"2006","unstructured":"Dooms, G., Katriel, I.: The minimum spanning tree constraint. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 152\u2013166. Springer, Heidelberg (2006). doi:\n10.1007\/11889205_13"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-540-72397-4_5","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"G Dooms","year":"2007","unstructured":"Dooms, G., Katriel, I.: The \u201cnot-too-heavy spanning tree\u201d constraint. In: Hentenryck, P., Wolsey, L. (eds.) CPAIOR 2007. LNCS, vol. 4510, pp. 59\u201370. Springer, Heidelberg (2007). doi:\n10.1007\/978-3-540-72397-4_5"},{"issue":"4","key":"15_CR6","first-page":"125","volume":"71","author":"J Edmonds","year":"1967","unstructured":"Edmonds, J.: Optimum branchings. J. Res. Nat. Bur. Stand. B 71(4), 125\u2013130 (1967)","journal-title":"J. Res. Nat. Bur. Stand. B"},{"issue":"1\u20134","key":"15_CR7","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1023\/A:1021193019522","volume":"115","author":"T Fahle","year":"2002","unstructured":"Fahle, T., Sellmann, M.: Cost based filtering for the constrained knapsack problem. Ann. Oper. Res. 115(1\u20134), 73\u201393 (2002)","journal-title":"Ann. Oper. Res."},{"key":"15_CR8","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01585701","volume":"53","author":"M Fischetti","year":"1992","unstructured":"Fischetti, M., Toth, P.: An additive bounding procedure for asymmetric travelling salesman problem. Math. Program. 53, 173\u2013197 (1992)","journal-title":"Math. Program."},{"issue":"3","key":"15_CR9","first-page":"1520","volume":"9","author":"M Fischetti","year":"1993","unstructured":"Fischetti, M., Toth, P.: An efficient algorithm for min-sum arborescence problem on complete digraphs. Manage. Sci. 9(3), 1520\u20131536 (1993)","journal-title":"Manage. Sci."},{"key":"15_CR10","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/(SICI)1097-0037(199701)29:1<55::AID-NET6>3.0.CO;2-B","volume":"29","author":"M Fischetti","year":"1997","unstructured":"Fischetti, M., Vigo, D.: A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem. Network 29, 55\u201367 (1997)","journal-title":"Network"},{"key":"15_CR11","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S1571-0653(04)00002-2","volume":"1","author":"F Focacci","year":"1999","unstructured":"Focacci, F., Lodi, A., Milano, M., Vigo, D.: Solving TSP through the integration of OR and CP techniques. Electron. Notes Discrete Math. 1, 13\u201325 (1999)","journal-title":"Electron. Notes Discrete Math."},{"issue":"3","key":"15_CR12","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02579168","volume":"6","author":"HN Gabow","year":"1986","unstructured":"Gabow, H.N., Galil, Z., Spencer, T.H., Tarjan, R.E.: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica 6(3), 109\u2013122 (1986)","journal-title":"Combinatorica"},{"key":"15_CR13","first-page":"13","volume":"7","author":"RL Graham","year":"1985","unstructured":"Graham, R.L., Hell, P.: On the history of the minimum spanning tree problem. Hist. Comput. 7, 13\u201325 (1985)","journal-title":"Hist. Comput."},{"key":"15_CR14","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1002\/net.3230200306","volume":"20","author":"M Guignard","year":"1990","unstructured":"Guignard, M., Rosenwein, M.B.: An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem. Network 20, 345\u2013359 (1990)","journal-title":"Network"},{"key":"15_CR15","unstructured":"Houndji, V.R., Schaus, P.: Cp4cap: Constraint programming for constrained arborescence problem. \nhttps:\/\/bitbucket.org\/ratheilesse\/cp4cap"},{"key":"15_CR16","unstructured":"Kleinberg, J., Tardos, E.: Minimum-cost arborescences: a multi-phase greedy algorithm. In: Algorithm Design, Tsinghua University Press (2005)"},{"key":"15_CR17","unstructured":"Lorca, X.: Contraintes de Partitionnement de Graphe. Ph. D. thesis, Universit\u00e9 de Nantes (2010)"},{"key":"15_CR18","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.) CP 2011. LNCS, vol. 6876, pp. 271\u2013285. Springer, Heidelberg (2011). doi:\n10.1007\/978-3-642-23786-7_22"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-27810-8_20","volume-title":"Algorithm Theory - SWAT 2004","author":"R Mendelson","year":"2004","unstructured":"Mendelson, R., Tarjan, R.E., Thorup, M., Zwick, U.: Melding priority queues. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 223\u2013235. Springer, Heidelberg (2004). doi:\n10.1007\/978-3-540-27810-8_20"},{"issue":"1","key":"15_CR20","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1287\/trsc.32.1.12","volume":"32","author":"G Pesant","year":"1998","unstructured":"Pesant, G., Gendreau, M., Potvin, J.-Y., Rousseau, J.-M.: An exact constraint logic programming algorithm for the traveling salesman problem with time windows. Transp. Sci. 32(1), 12\u201329 (1998)","journal-title":"Transp. Sci."},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-540-68155-7_19","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"J-C R\u00e9gin","year":"2008","unstructured":"R\u00e9gin, J.-C.: Simpler and incremental consistency checking and arc consistency filtering algorithms for the weighted spanning tree constraint. In: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol. 5015, pp. 233\u2013247. Springer, Heidelberg (2008). doi:\n10.1007\/978-3-540-68155-7_19"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-642-13520-0_31","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"J-C R\u00e9gin","year":"2010","unstructured":"R\u00e9gin, J.-C., Rousseau, L.-M., Rueher, M., van Hoeve, W.-J.: The weighted spanning tree constraint revisited. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 287\u2013291. Springer, Heidelberg (2010). doi:\n10.1007\/978-3-642-13520-0_31"},{"issue":"3","key":"15_CR23","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1002\/net.3230070103","volume":"7","author":"RE Tarjan","year":"1977","unstructured":"Tarjan, R.E.: Finding optimum branchings. Networks 7(3), 25\u201335 (1977)","journal-title":"Networks"},{"key":"15_CR24","unstructured":"OscaR Team. Oscar: Scala in or (2012). \nhttps:\/\/bitbucket.org\/oscarlib\/oscar"},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-319-18008-3_29","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"S Cauwelaert Van","year":"2015","unstructured":"Van Cauwelaert, S., Lombardi, M., Schaus, P.: Understanding the potential of propagators. In: Michel, L. (ed.) CPAIOR 2015. LNCS, vol. 9075, pp. 427\u2013436. Springer, Cham (2015). doi:\n10.1007\/978-3-319-18008-3_29"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59776-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,30]],"date-time":"2017-05-30T09:31:26Z","timestamp":1496136686000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59776-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319597751","9783319597768"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59776-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}