{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:00:51Z","timestamp":1725559251019},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540261520"},{"type":"electronic","value":"9783540322641"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11493853_11","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T07:35:25Z","timestamp":1279092925000},"page":"125-139","source":"Crossref","is-referenced-by-count":0,"title":["On the Minimal Steiner Tree Subproblem and Its Application in Branch-and-Price"],"prefix":"10.1007","author":[{"given":"Wilhelm","family":"Cronholm","sequence":"first","affiliation":[]},{"given":"Farid","family":"Ajili","sequence":"additional","affiliation":[]},{"given":"Sofia","family":"Panagiotidi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_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":"11_CR2","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/PL00009180","volume":"19","author":"B.V. Cherkassky","year":"1997","unstructured":"Cherkassky, B.V., Goldberg, A.V.: On implementing the push-relabel method for the maximum flow problem. Algorithmica\u00a019, 390\u2013410 (1997)","journal-title":"Algorithmica"},{"issue":"3","key":"11_CR3","first-page":"320","volume":"4","author":"S. Chopra","year":"1992","unstructured":"Chopra, S., Gorres, E.R., Rao, M.R.: Solving the Steiner tree problem on a graph using branch and cut. Journal on Computing\u00a04(3), 320\u2013335 (1992)","journal-title":"Journal on Computing"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01582573","volume":"64","author":"S. Chopra","year":"1994","unstructured":"Chopra, S., Rao, M.R.: The Steiner tree problem I: Formulations, compositions and extension of facets. Mathematical Programming\u00a064, 209\u2013229 (1994)","journal-title":"Mathematical Programming"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1007\/978-3-540-30201-8_55","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"W. Cronholm","year":"2004","unstructured":"Cronholm, W., Ajili, F.: Strong cost-based filtering for Lagrange decomposition applied to network design. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 726\u2013730. Springer, Heidelberg (2004)"},{"key":"11_CR6","unstructured":"Cronholm, W., Ajili, F.: Hybrid branch-and-price for multicast network design. In: Proceedings of the 2nd International Network Optimization Conference (March 2005) (to appear)"},{"key":"11_CR7","unstructured":"Cronholm, W., Ouaja, W., Ajili, F.: Strengthening optimality reasoning for a network routing application. In: Proceedings of the Fourth Workshop on Cooperative Solvers in Constraint Programming, COSOLV 2004, Toronto, Canada (September 2004)"},{"issue":"4","key":"11_CR8","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A.V. Goldberg","year":"1988","unstructured":"Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. Journal of the Association for Computing Machinery\u00a035(4), 921\u2013940 (1988)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1006\/jagm.1994.1043","volume":"17","author":"J. Hao","year":"1994","unstructured":"Hao, J., Orlin, J.B.: A faster algorithm for finding the minimum cut in a directed graph. Journal of Algorithms\u00a017, 424\u2013446 (1994)","journal-title":"Journal of Algorithms"},{"key":"11_CR10","series-title":"Annals of Discrete Mathematics","volume-title":"The Steiner Tree Problem","author":"F.K. Hwang","year":"1992","unstructured":"Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem. Annals of Discrete Mathematics, vol.\u00a053. Elsevier Science Publishers B. V., Amsterdam (1992)"},{"issue":"4","key":"11_CR11","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0167-6377(02)00182-7","volume":"30","author":"H. Kerivin","year":"2002","unstructured":"Kerivin, H., Mahjoub, A.R.: Separation of partition inequalities for the (1,2)-survivable network design problem. Operations Research Letters\u00a030(4), 265\u2013268 (2002)","journal-title":"Operations Research Letters"},{"issue":"3","key":"11_CR12","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<207::AID-NET5>3.0.CO;2-O","volume":"32","author":"T. Koch","year":"1998","unstructured":"Koch, T., Martin, A.: Solving Steiner tree problems in graphs to optimality. Networks\u00a032(3), 207\u2013232 (1998)","journal-title":"Networks"},{"key":"11_CR13","unstructured":"Koch, T., Martin, A., Vo\u00df, S.: SteinLib: An updated library on steiner tree problems in graphs. Technical Report ZIB-Report 00-37, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, Takustr. 7, Berlin (2000)"},{"key":"11_CR14","unstructured":"Levine, M.S.: Experimental study of minimum cut algorithms. Master\u2019s thesis, Massachusetts Institute of Technology (1995)"},{"issue":"1","key":"11_CR15","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1002\/(SICI)1097-0037(199801)31:1<39::AID-NET5>3.0.CO;2-L","volume":"31","author":"A. Lucena","year":"1998","unstructured":"Lucena, A., Beasley, J.E.: A branch and cut algorithm for the Steiner problem in graphs. Networks, an International Journal\u00a031(1), 39\u201359 (1998)","journal-title":"Networks, an International Journal"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF01580850","volume":"47","author":"M. Padberg","year":"1990","unstructured":"Padberg, M., Rinaldi, G.: An efficient algorithm for the minimum capacity cut problem. Mathematical Programming\u00a047, 19\u201336 (1990)","journal-title":"Mathematical Programming"},{"key":"11_CR17","unstructured":"Panagiotidi, S.: Efficient implementation of a preflow push solver and its application to network design. Master\u2019s thesis, Imperial College London (September 2004)"},{"key":"11_CR18","unstructured":"Polzin, T.: Algorithms for the Steiner Problem in Networks. PhD thesis, Faculty of Science and Technology, University of Saarlandes (May 2003)"},{"issue":"4","key":"11_CR19","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1002\/net.10026","volume":"39","author":"M. Prytz","year":"2002","unstructured":"Prytz, M., Forsgren, A.: Dimensioning multicast-enabled communications networks. Networks\u00a039(4), 216\u2013231 (2002)","journal-title":"Networks"}],"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\/11493853_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,31]],"date-time":"2021-10-31T10:48:51Z","timestamp":1635677331000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11493853_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540261520","9783540322641"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11493853_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}