{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T01:06:11Z","timestamp":1777597571603,"version":"3.51.4"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2011,7,22]],"date-time":"2011-07-22T00:00:00Z","timestamp":1311292800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s11590-011-0368-1","type":"journal-article","created":{"date-parts":[[2011,7,21]],"date-time":"2011-07-21T08:39:26Z","timestamp":1311237566000},"page":"1753-1771","source":"Crossref","is-referenced-by-count":1,"title":["A branch-and-cut algorithm for the Steiner tree problem with delays"],"prefix":"10.1007","volume":"6","author":[{"given":"V.","family":"Leggieri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Haouari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Triki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,7,22]]},"reference":[{"issue":"1","key":"368_CR1","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.orl.2004.04.002","volume":"33","author":"T. Achterberg","year":"2005","unstructured":"Achterberg T., Koch T., Martin A.: Branching rules revisited. Oper. Res. Lett. 33(1), 42\u201354 (2005)","journal-title":"Oper. Res. Lett."},{"key":"368_CR2","doi-asserted-by":"crossref","unstructured":"Althaus, E., Polzin, T., Daneshmand, S.V.: Improving linear programming approaches for the Steiner tree problem. In: Experimental and efficient algorithms. Lecture Notes in Computer Science, vol. 2647, pp. 1\u201314. Springer, Berlin (2003)","DOI":"10.1007\/3-540-44867-5_1"},{"issue":"2","key":"368_CR3","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/net.3230100207","volume":"10","author":"Y.P. Aneja","year":"1980","unstructured":"Aneja Y.P.: An integer linear programming approach to the Steiner problem in graphs. Networks 10(2), 167\u2013178 (1980)","journal-title":"Networks"},{"key":"368_CR4","unstructured":"Applegate, D., Bixby, R., Cook W.: Finding cuts in the tsp (a preliminary report) (1995)"},{"issue":"3, Ser. A","key":"368_CR5","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/PL00011432","volume":"90","author":"N. Ascheuer","year":"2001","unstructured":"Ascheuer N., Fischetti M., Gr\u00f6tschel M.: Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Math. Program. 90(3, Ser. A), 475\u2013506 (2001)","journal-title":"Math. Program."},{"issue":"2","key":"368_CR6","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/1097-0037(200009)36:2<69::AID-NET1>3.0.CO;2-Q","volume":"36","author":"N. Ascheuer","year":"2000","unstructured":"Ascheuer N., Fischetti M., Gr\u00f6tschel M.: A polyhedral study of the asymmetric traveling salesman problem with time windows. Networks 36(2), 69\u201379 (2000)","journal-title":"Networks"},{"issue":"1","key":"368_CR7","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.ejor.2007.06.012","volume":"190","author":"A.M. Costa","year":"2008","unstructured":"Costa A.M., Cordeau J.-F., Laporte G.: Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints. Eur. J. Oper. Res. 190(1), 68\u201378 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"368_CR8","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1002\/net.20274","volume":"53","author":"A.M. Costa","year":"2009","unstructured":"Costa A.M., Cordeau J.F., Laporte G.: Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints. Networks 53(2), 141\u2013159 (2009)","journal-title":"Networks"},{"key":"368_CR9","doi-asserted-by":"crossref","unstructured":"Du, D.Z., Lu, B., Ngo, H., Pardalos, P.M.: Steiner tree problems. In: Floudas, C., Pardalos, P. (eds.) Encyclopedia of Optimization, vol. 5, pp. 227\u2013290 (2001)","DOI":"10.1007\/0-306-48332-7_489"},{"issue":"3\u20134","key":"368_CR10","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s11235-007-9031-7","volume":"34","author":"N. Ghaboosi","year":"2007","unstructured":"Ghaboosi N., Haghighat A.T.: Tabu search based algorithms for bandwidth-delay-constrained least-cost multicast routing. Telecommun. Syst. 34(3\u20134), 147\u2013166 (2007)","journal-title":"Telecommun. Syst."},{"issue":"2","key":"368_CR11","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0377-2217(97)00369-X","volume":"108","author":"A. Ghanwani","year":"1998","unstructured":"Ghanwani A.: Neural and delay based heuristics for the Steiner problem in networks. Eur. J. Oper. Res. 108(2), 241\u2013265 (1998)","journal-title":"Eur. J. Oper. Res."},{"issue":"9","key":"368_CR12","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1016\/0305-0548(94)00074-I","volume":"22","author":"L. Gouveia","year":"1995","unstructured":"Gouveia L.: Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints. Comput. Oper. Res. 22(9), 959\u2013970 (1995)","journal-title":"Comput. Oper. Res."},{"key":"368_CR13","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1287\/ijoc.12.1.2.11900","volume":"12","author":"E.L. Johnson","year":"2000","unstructured":"Johnson E.L., Nemhauser G.L., Savelsbergh M.W.P.: Progress in linear programming-based algorithms for integer programming: an exposition. INFORMS J. Comput. 12, 2\u201323 (2000)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"368_CR14","doi-asserted-by":"crossref","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 32(3), 207\u2013232 (1998)","journal-title":"Networks"},{"key":"368_CR15","unstructured":"Koch, T., Martin, A., Vo\u03b2, S.: SteinLib. http:\/\/elib.zib.de\/steinlib"},{"issue":"3","key":"368_CR16","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1109\/90.234851","volume":"1","author":"V.P. Kompella","year":"1993","unstructured":"Kompella V.P., Pasquale J., Polyzos G.C.: Multicast routing for multimedia communication. IEEE\/ACM Trans. Netw. 1(3), 286\u2013292 (1993)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"11","key":"368_CR17","doi-asserted-by":"crossref","first-page":"1356","DOI":"10.1016\/j.comcom.2004.12.003","volume":"28","author":"Z. Kun","year":"2005","unstructured":"Kun Z., Heng W., Liu F.Y.: Distributed multicast routing for delay and delay variation-bounded Steiner tree using simulated annealing. Comput. Commun. 28(11), 1356\u20131370 (2005)","journal-title":"Comput. Commun."},{"key":"368_CR18","doi-asserted-by":"crossref","unstructured":"Leggieri, V., Haouari, M., Layeb, S., Triki, C. The Steiner tree problem with delays: a compact formulation and reduction procedures. Discret. Appl. Math. (2011, in press)","DOI":"10.1016\/j.dam.2011.07.008"},{"issue":"4","key":"368_CR19","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"C.E. Miller","year":"1960","unstructured":"Miller C.E., Tucker A.W., Zemlin R.A.: Integer programming formulation of traveling salesman problems. J. Assoc. Comput. Mach. 7(4), 326\u2013329 (1960)","journal-title":"J. Assoc. Comput. Mach."},{"key":"368_CR20","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and combinatorial optimization. Wiley-Interscience Series in Discrete Mathematics and Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser G.L., Wolsey L.A.: Integer and combinatorial optimization. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons Inc., New York (1988)"},{"issue":"8","key":"368_CR21","doi-asserted-by":"crossref","first-page":"1953","DOI":"10.1016\/j.cor.2003.12.007","volume":"32","author":"C.A.S. Oliveira","year":"2005","unstructured":"Oliveira C.A.S., Pardalos P.M.: A survey of combinatorial optimization problems in multicast routing. Comput. Oper. Res. 32(8), 1953\u20131981 (2005)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"368_CR22","doi-asserted-by":"crossref","first-page":"898","DOI":"10.1007\/s10559-006-0026-2","volume":"41","author":"C.A.S. Oliveira","year":"2005","unstructured":"Oliveira C.A.S., Pardalos P.M.: Construction algorithms and approximation bounds for the streaming cache placement problem in multicast networks. Cybern. Syst. Anal. 41(6), 898\u2013908 (2005)","journal-title":"Cybern. Syst. Anal."},{"issue":"1\u20133","key":"368_CR23","first-page":"241","volume":"112","author":"T. Polzin","year":"2001","unstructured":"Polzin T., Daneshmand S.V.: A comparison of Steiner tree relaxations. Discret. Appl. Math. J. Comb. Algorithms Inform. Comput. Sci. 112(1\u20133), 241\u2013261 (2001)","journal-title":"Discret. Appl. Math. J. Comb. Algorithms Inform. Comput. Sci."},{"issue":"1","key":"368_CR24","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.orl.2009.09.008","volume":"38","author":"M. Santos","year":"2010","unstructured":"Santos M., Drummond L.M.A., Uchoa E.: A distributed dual ascent algorithm for the hop-constrained Steiner tree problem. Oper. Res. Lett. 38(1), 57\u201362 (2010)","journal-title":"Oper. Res. Lett."},{"issue":"18","key":"368_CR25","doi-asserted-by":"crossref","first-page":"1693","DOI":"10.1016\/S0140-3664(98)00208-4","volume":"21","author":"R. Sriram","year":"1998","unstructured":"Sriram R., Manimaran G., Ram Murthy C.S.: Algorithms for delay-constrained low-cost multicast tree construction. Comput. Commun. 21(18), 1693\u20131706 (1998)","journal-title":"Comput. Commun."},{"key":"368_CR26","volume-title":"Integer Programming","author":"L.A. Wolsey","year":"1998","unstructured":"Wolsey L.A.: Integer Programming. Wiley-Interscience, New York (1998)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0368-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-011-0368-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0368-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T07:15:32Z","timestamp":1741331732000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-011-0368-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,22]]},"references-count":26,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["368"],"URL":"https:\/\/doi.org\/10.1007\/s11590-011-0368-1","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,22]]}}}