{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T12:05:07Z","timestamp":1770984307644,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,9,21]],"date-time":"2011-09-21T00:00:00Z","timestamp":1316563200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s10479-011-0962-8","type":"journal-article","created":{"date-parts":[[2011,9,20]],"date-time":"2011-09-20T10:53:17Z","timestamp":1316515997000},"page":"333-360","source":"Crossref","is-referenced-by-count":5,"title":["A decomposition approach for solving a broadcast domination network design problem"],"prefix":"10.1007","volume":"210","author":[{"given":"Siqian","family":"Shen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Cole","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,9,21]]},"reference":[{"issue":"1","key":"962_CR1","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J. F. Benders","year":"1962","unstructured":"Benders, J. F. (1962). Partitioning procedures for solving mixed variables programming problems. Numerische Mathematik, 4(1), 238\u2013252.","journal-title":"Numerische Mathematik"},{"key":"962_CR2","volume-title":"Theory of graphs and its applications","author":"C. Berge","year":"1962","unstructured":"Berge, C. (1962). Theory of graphs and its applications. New York: Wiley."},{"key":"962_CR3","first-page":"109","volume":"173","author":"J. R. S. Blair","year":"2005","unstructured":"Blair, J. R. S., & Horton, S. B. (2005). Broadcast covers in graphs. Congressus Numerantium, 173, 109\u2013115.","journal-title":"Congressus Numerantium"},{"key":"962_CR4","first-page":"55","volume":"169","author":"J. R. S. Blair","year":"2004","unstructured":"Blair, J. R. S., Heggernes, P., Horton, S., & Manne, F. (2004). Broadcast domination algorithms for interval graphs, series-parallel graphs, and trees. Congressus Numerantium, 169, 55\u201377.","journal-title":"Congressus Numerantium"},{"key":"962_CR5","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/11493853_9","volume-title":"Integration of AI and OR techniques in constraint programming for combinatorial optimization problems (CPAIOR 2005)","author":"H. Cambazard","year":"2005","unstructured":"Cambazard, H., & Jussien, N. (2005). Identifying and exploiting problem structures using explanation-based constraint programming. In R. Bart\u00e1k & M. Milano (Eds.), Lecture notes in computer science: Vol. 3524. Integration of AI and OR techniques in constraint programming for combinatorial optimization problems (CPAIOR 2005) (pp. 94\u2013109). Berlin: Springer."},{"key":"962_CR6","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/978-3-540-30201-8_14","volume-title":"Principles and practice of constraint programming (CP 2004)","author":"H. Cambazard","year":"2004","unstructured":"Cambazard, H., Hladik, P.-E., D\u00e9planche, A.-M., Jussien, N., & Trinquet, Y. (2004). Decomposition and learning for a hard real time task allocation problem. In M. Wallace (Ed.), Lecture notes in computer science: Vol. 3258. Principles and practice of constraint programming (CP 2004) (pp. 153\u2013167). Berlin: Springer."},{"issue":"1\u20133","key":"962_CR7","first-page":"451","volume":"83","author":"C. C. Car\u00f8e","year":"1997","unstructured":"Car\u00f8e, C. C., & Tind, J. (1997). L-shaped decomposition of two-stage stochastic programs with integer recourse. Mathematical Programming, 83(1\u20133), 451\u2013464.","journal-title":"Mathematical Programming"},{"issue":"4","key":"962_CR8","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1287\/opre.1060.0286","volume":"54","author":"G. Codato","year":"2006","unstructured":"Codato, G., & Fischetti, M. (2006). Combinatorial Benders\u2019 cuts for mixed-integer linear programming. Operations Research, 54(4), 756\u2013766.","journal-title":"Operations Research"},{"key":"962_CR9","unstructured":"de Jaenisch, C. F. (1862). Applications de l\u2019analyse mathematique au jue des echecs. Petrograd."},{"key":"962_CR10","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.dam.2005.07.009","volume":"154","author":"J. E. Dunbar","year":"2006","unstructured":"Dunbar, J. E., Erwin, D. J., Haynes, T. W., Hedetniemi, S. M., & Hedetniemi, S. T. (2006). Broadcasts in graphs. Discrete Applied Mathematics, 154, 59\u201375.","journal-title":"Discrete Applied Mathematics"},{"key":"962_CR11","first-page":"89","volume":"42","author":"D. J. Erwin","year":"2004","unstructured":"Erwin, D. J. (2004). Dominating broadcasts in graphs. Bulletin of the Institute of Combinatorics and Its Applications, 42, 89\u2013105.","journal-title":"Bulletin of the Institute of Combinatorics and Its Applications"},{"key":"962_CR12","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF01580620","volume":"60","author":"O. E. Flippo","year":"1993","unstructured":"Flippo, O. E., & Rinnooy Kan, A. H. G. (1993). Decomposition in general mathematical programming. Mathematical Programming, 60, 361\u2013382.","journal-title":"Mathematical Programming"},{"key":"962_CR13","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. San Francisco: Freeman."},{"issue":"4","key":"962_CR14","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"A. M. Geoffrion","year":"1972","unstructured":"Geoffrion, A. M. (1972). Generalized Benders decomposition. Journal of Optimization Theory and Applications, 10(4), 237\u2013260.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"962_CR15","volume-title":"Domination in graphs: advanced topics","year":"1998","unstructured":"Haynes, T. W., Hedetniemi, S. T., & Slater, P. J. (Eds.) (1998a). Domination in graphs: advanced topics. New York: Dekker,"},{"key":"962_CR16","volume-title":"Fundamentals of domination in graphs","author":"T. W. Haynes","year":"1998","unstructured":"Haynes, T. W., Hedetniemi, S. T., & Slater, P. J. (1998b). Fundamentals of domination in graphs. New York: Dekker."},{"issue":"24","key":"962_CR17","doi-asserted-by":"crossref","first-page":"3267","DOI":"10.1016\/j.disc.2006.06.013","volume":"306","author":"P. Heggernes","year":"2006","unstructured":"Heggernes, P., & Lokshtanov, D. (2006). Optimal broadcast domination in polynomial time. Discrete Mathematics, 306(24), 3267\u20133280.","journal-title":"Discrete Mathematics"},{"key":"962_CR18","doi-asserted-by":"crossref","DOI":"10.1002\/9781118033036","volume-title":"Logic-based methods for optimization: combining optimization and constraint satisfaction","author":"J. N. Hooker","year":"2000","unstructured":"Hooker, J. N. (2000). Logic-based methods for optimization: combining optimization and constraint satisfaction. New York: Wiley."},{"issue":"4","key":"962_CR19","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s10601-005-2812-2","volume":"10","author":"J. N. Hooker","year":"2005","unstructured":"Hooker, J. N. (2005a). A hybrid method for the planning and scheduling. Constraints, 10(4), 385\u2013401.","journal-title":"Constraints"},{"key":"962_CR20","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/11564751_25","volume-title":"Principles and practice of constraint programming (CP 2005)","author":"J. N. Hooker","year":"2005","unstructured":"Hooker, J. N. (2005b). Planning and scheduling to minimize tardiness. In Lecture notes in computer science: Vol. 3709. Principles and practice of constraint programming (CP 2005) (pp. 314\u2013327). Berlin: Springer."},{"issue":"3","key":"962_CR21","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1287\/opre.1060.0371","volume":"55","author":"J. N. Hooker","year":"2007","unstructured":"Hooker, J. N. (2007). Planning and scheduling by logic-based Benders decomposition. Operations Research, 55(3), 588.","journal-title":"Operations Research"},{"issue":"1","key":"962_CR22","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"J. N. Hooker","year":"2003","unstructured":"Hooker, J. N., & Ottosson, G. (2003). Logic-based Benders decomposition. Mathematical Programming, 96(1), 33\u201360.","journal-title":"Mathematical Programming"},{"issue":"3","key":"962_CR23","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-6377(93)90002-X","volume":"13","author":"G. Laporte","year":"1993","unstructured":"Laporte, G., & Louveaux, F. V. (1993). The integer L-shaped method for stochastic integer programs with complete recourse. Operations Research Letters, 13(3), 133\u2013142.","journal-title":"Operations Research Letters"},{"issue":"3","key":"962_CR24","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1287\/trsc.26.3.161","volume":"26","author":"G. Laporte","year":"1992","unstructured":"Laporte, G., Louveaux, F. V., & Mercure, H. (1992). The vehicle routing problem with stochastic travel times. Transportation Science, 26(3), 161\u2013170.","journal-title":"Transportation Science"},{"issue":"2","key":"962_CR25","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1287\/trsc.28.2.95","volume":"28","author":"G. Laporte","year":"1994","unstructured":"Laporte, G., Louveaux, F. V., & Van Hamme, L. (1994). Exact solution to a location problem with stochastic demands. Transportation Science, 28(2), 95\u2013103.","journal-title":"Transportation Science"},{"key":"962_CR26","unstructured":"Lokshtanov, D. (2007). Broadcast domination. Master\u2019s thesis, Department of Informatics, University of Bergen, Bergen, Norway."},{"key":"962_CR27","volume-title":"Theory of graphs","author":"O. Ore","year":"1967","unstructured":"Ore, O. (1967). Theory of graphs (3rd ed., Vol.\u00a038). Providence: Am. Math. Soc.","edition":"3"},{"issue":"5","key":"962_CR28","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1002\/nav.20401","volume":"57","author":"J. Penuel","year":"2010","unstructured":"Penuel, J., Smith, J. C., & Yuan, Y. (2010). An integer decomposition algorithm for solving a two-stage facility location problem with second-stage activation costs. Naval Research Logistics, 57(5), 391\u2013402.","journal-title":"Naval Research Logistics"},{"issue":"8","key":"962_CR29","doi-asserted-by":"crossref","first-page":"1237","DOI":"10.1016\/j.compchemeng.2009.10.002","volume":"34","author":"G. K. D. Saharidis","year":"2010","unstructured":"Saharidis, G. K. D., & Ierapetritou, M. G. (2010). Improving Benders decomposition using maximum feasible subsystem (MFS) cut generation strategy. Computers & Chemical Engineering, 34(8), 1237\u20131245.","journal-title":"Computers & Chemical Engineering"},{"issue":"6","key":"962_CR30","doi-asserted-by":"crossref","first-page":"6627","DOI":"10.1016\/j.eswa.2010.11.075","volume":"38","author":"G. K. D. Saharidis","year":"2010","unstructured":"Saharidis, G. K. D., Boile, M., & Theofanis, S. (2010a). Initialization of the Benders master problem using valid inequalities applied to fixed-charge network problems. Expert Systems With Applications, 38(6), 6627\u20136636.","journal-title":"Expert Systems With Applications"},{"issue":"2","key":"962_CR31","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1111\/j.1475-3995.2009.00706.x","volume":"17","author":"G. K. D. Saharidis","year":"2010","unstructured":"Saharidis, G. K. D., Minoux, M., & Ierapetritou, M. G. (2010b). Accelerating Benders method using covering cut bundle generation. International Transactions in Operational Research, 17(2), 221\u2013237.","journal-title":"International Transactions in Operational Research"},{"issue":"1","key":"962_CR32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-004-0566-z","volume":"104","author":"S. Sen","year":"2005","unstructured":"Sen, S., & Higle, J. L. (2005). The C 3 theorem and a D 2 algorithm for large-scale stochastic mixed-integer programming: Set convexification. Mathematical Programming, 104(1), 1\u201320.","journal-title":"Mathematical Programming"},{"key":"962_CR33","volume-title":"Encyclopedia of operations research and management science","author":"S. Shen","year":"2011","unstructured":"Shen, S. (2011). Domination problems. In J. J. Cochran (Ed.), Encyclopedia of operations research and management science. Hoboken: Wiley."},{"issue":"3","key":"962_CR34","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"H. D. Sherali","year":"1990","unstructured":"Sherali, H. D., & Adams, W. P. (1990). A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM Journal on Discrete Mathematics, 3(3), 411\u2013430.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"962_CR35","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0166-218X(92)00190-W","volume":"52","author":"H. D. Sherali","year":"1994","unstructured":"Sherali, H. D., & Adams, W. P. (1994). A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems. Discrete Applied Mathematics, 52(1), 83\u2013106.","journal-title":"Discrete Applied Mathematics"},{"issue":"1\u20134","key":"962_CR36","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1023\/A:1013827731218","volume":"22","author":"H. D. Sherali","year":"2002","unstructured":"Sherali, H. D., & Fraticelli, B. M. P. (2002). A modification of Benders\u2019 decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse. Journal of Global Optimization, 22(1\u20134), 319\u2013342.","journal-title":"Journal of Global Optimization"},{"issue":"4","key":"962_CR37","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1137\/0117061","volume":"17","author":"R. M. Slyke Van","year":"1969","unstructured":"Van Slyke, R. M., & Wets, R. (1969). L-shaped linear programs with applications to optimal control and stochastic programming. SIAM Journal on Applied Mathematics, 17(4), 638\u2013663.","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"1","key":"962_CR38","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01581648","volume":"19","author":"R. Wollmer","year":"1980","unstructured":"Wollmer, R. (1980). Two-stage linear programming under uncertainty with 0\u20131 first stage variables. Mathematical Programming, 19(1), 279\u2013288.","journal-title":"Mathematical Programming"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0962-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-011-0962-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0962-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,12]],"date-time":"2024-04-12T02:47:15Z","timestamp":1712890035000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-011-0962-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,21]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["962"],"URL":"https:\/\/doi.org\/10.1007\/s10479-011-0962-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9,21]]}}}