{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:16:48Z","timestamp":1742980608212,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030261757"},{"type":"electronic","value":"9783030261764"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-26176-4_22","type":"book-chapter","created":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T23:02:56Z","timestamp":1563922976000},"page":"266-278","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Branch-and-Cut Algorithms for Steiner Tree Problems with Privacy Conflicts"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4989-7587","authenticated-orcid":false,"given":"Alessandro","family":"Hill","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1296-4221","authenticated-orcid":false,"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0938-5798","authenticated-orcid":false,"given":"Roberto","family":"Baldacci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,21]]},"reference":[{"issue":"1","key":"22_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.3230190102","volume":"19","author":"JE Beasley","year":"1989","unstructured":"Beasley, J.E.: An SST-based algorithm for the Steiner problem in graphs. Networks 19(1), 1\u201316 (1989)","journal-title":"Networks"},{"issue":"2","key":"22_CR2","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1002\/net.20274","volume":"53","author":"AM 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":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/978-3-319-42432-3_63","volume-title":"Mathematical Software \u2013 ICMS 2016","author":"L Di Puglia Pugliese","year":"2016","unstructured":"Di Puglia Pugliese, L., Gaudioso, M., Guerriero, F., Miglionico, G.: An algorithm to find the link constrained Steiner tree in undirected graphs. In: Greuel, G.-M., Koch, T., Paule, P., Sommese, A. (eds.) ICMS 2016. LNCS, vol. 9725, pp. 492\u2013497. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-42432-3_63"},{"issue":"3","key":"22_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"SE Dreyfus","year":"1971","unstructured":"Dreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks 1(3), 195\u2013207 (1971)","journal-title":"Networks"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-642-78910-6_160","volume-title":"Operations Research Proceedings 1993","author":"Cees Duin","year":"1994","unstructured":"Duin, C., Vo\u00df, S.: Steiner tree heuristics\u2014a survey. In: Operations Research Proceedings 1993. ORP, vol. 1993, pp. 485\u2013496. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/978-3-642-78910-6_160"},{"issue":"2","key":"22_CR6","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s12532-016-0114-x","volume":"9","author":"G Gamrath","year":"2017","unstructured":"Gamrath, G., Koch, T., Maher, S.J., Rehfeldt, D., Shinano, Y.: SCIP-Jack\u2014a solver for STP and variants with parallelization extensions. Math. Program. Comput. 9(2), 231\u2013296 (2017)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"22_CR7","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1002\/net.3230230104","volume":"23","author":"MX Goemans","year":"1993","unstructured":"Goemans, M.X., Myung, Y.-S.: A catalog of Steiner tree formulations. Networks 23(1), 19\u201328 (1993)","journal-title":"Networks"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.cor.2018.02.004","volume":"94","author":"A Hill","year":"2018","unstructured":"Hill, A., Schwarze, S.: Exact algorithms for bi-objective ring tree problems with reliability measures. Comput. Oper. Res. 94, 38\u201351 (2018)","journal-title":"Comput. Oper. Res."},{"key":"22_CR9","unstructured":"Johnson, D.S., Minkoff, M., Phillips, S.: The prize collecting Steiner tree problem: theory and practice. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 760\u2013769. Society for Industrial and Applied Mathematics (2000)"},{"key":"22_CR10","series-title":"The IBM Research Symposia Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. IRSS, pp. 85\u2013103. Springer, Boston (1972)"},{"issue":"3","key":"22_CR11","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 32(3), 207\u2013232 (1998)","journal-title":"Networks"},{"key":"22_CR12","series-title":"Combinatorial Optimization","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-1-4613-0255-1_9","volume-title":"Steiner Trees in Industry","author":"T Koch","year":"2001","unstructured":"Koch, T., Martin, A., Vo\u00df, S.: SteinLib: an updated library on steiner tree problems in graphs. In: Cheng, X.Z., Du, D.Z. (eds.) Steiner Trees in Industry. Combinatorial Optimization, vol. 11, pp. 285\u2013325. Springer, Boston (2001). https:\/\/doi.org\/10.1007\/978-1-4613-0255-1_9"},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.dam.2011.07.008","volume":"164","author":"V Leggieri","year":"2014","unstructured":"Leggieri, V., Haouari, M., Triki, C.: The Steiner tree problem with delays: a compact formulation and reduction procedures. Discrete Appl. Math. 164, 178\u2013190 (2014)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"22_CR14","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0166-218X(00)00318-8","volume":"112","author":"T Polzin","year":"2001","unstructured":"Polzin, T., Daneshmand, S.V.: A comparison of Steiner tree relaxations. Discrete Appl. Math. 112(1), 241\u2013261 (2001)","journal-title":"Discrete Appl. Math."},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1023\/A:1018967121276","volume":"86","author":"S Vo\u00df","year":"1999","unstructured":"Vo\u00df, S.: The Steiner tree problem with hop constraints. Ann. Oper. Res. 86, 321\u2013345 (1999)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"22_CR16","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF02612335","volume":"28","author":"RT Wong","year":"1984","unstructured":"Wong, R.T.: A dual ascent approach for Steiner tree problems on a directed graph. Math. Program. 28(3), 271\u2013287 (1984)","journal-title":"Math. Program."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26176-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:06:12Z","timestamp":1709820372000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-26176-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030261757","9783030261764"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26176-4_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"21 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ictt.xidian.edu.cn\/COCOON2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}