{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T22:42:55Z","timestamp":1778798575178,"version":"3.51.4"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,2,9]],"date-time":"2012-02-09T00:00:00Z","timestamp":1328745600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s10589-012-9458-y","type":"journal-article","created":{"date-parts":[[2012,2,8]],"date-time":"2012-02-08T16:53:40Z","timestamp":1328720020000},"page":"649-680","source":"Crossref","is-referenced-by-count":106,"title":["Branch and cut algorithms for detecting critical nodes in undirected graphs"],"prefix":"10.1007","volume":"53","author":[{"given":"Marco","family":"Di\u00a0Summa","sequence":"first","affiliation":[]},{"given":"Andrea","family":"Grosso","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Locatelli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,2,9]]},"reference":[{"key":"9458_CR1","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10898-008-9372-0","volume":"43","author":"K.M. Anstreicher","year":"2009","unstructured":"Anstreicher, K.M.: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. J. Glob. Optim. 43, 471\u2013484 (2009)","journal-title":"J. Glob. Optim."},{"key":"9458_CR2","doi-asserted-by":"crossref","first-page":"2193","DOI":"10.1016\/j.cor.2008.08.016","volume":"36","author":"A. Arulselvan","year":"2009","unstructured":"Arulselvan, A., Commander, C.W., Elefteriadou, L., Pardalos, P.M.: Detecting critical nodes in sparse graphs. Comput. Oper. Res. 36, 2193\u20132200 (2009)","journal-title":"Comput. Oper. Res."},{"key":"9458_CR3","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1142\/9789812771667_0007","volume-title":"Clustering Challenges in Biological Networks","author":"V. Boginski","year":"2009","unstructured":"Boginski, V., Commander, C.W.: Identifying critical nodes in protein\u2013protein interaction networks. In: Butenko, S., Art\u00a0Chaovalitwongse, W., Pardalos, P.M. (eds.) Clustering Challenges in Biological Networks, pp. 153\u2013167. World Scientific, Singapore (2009)"},{"key":"9458_CR4","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1080\/10556789908805765","volume":"11","author":"B. Borchers","year":"1999","unstructured":"Borchers, B.: CSDP, a C library for semidefinite programming. Optim. Methods Softw. 11, 613\u2013623 (1999)","journal-title":"Optim. Methods Softw."},{"key":"9458_CR5","unstructured":"Christof, T.: PORTA\u2014a Polyhedron Representation Transformation Algorithm. Free software. Revised by A. L\u00f6bel"},{"key":"9458_CR6","first-page":"105","volume-title":"Proceedings of the 29th IEEE Conference on Computer Communications (INFOCOM)","author":"T.N. Dinh","year":"2010","unstructured":"Dinh, T.N., Xuan, Y., Thai, M.T., Park, E.K., Znati, T.: On approximation of new optimization methods for assessing network vulnerability. In: Proceedings of the 29th IEEE Conference on Computer Communications (INFOCOM), pp. 105\u2013118 (2010)"},{"key":"9458_CR7","unstructured":"Dreier, D.: Barabasi graph generator v1.4. http:\/\/www.cs.ucr.edu\/ddreier"},{"key":"9458_CR8","first-page":"170","volume-title":"COCOA","author":"N. Fan","year":"2010","unstructured":"Fan, N., Pardalos, P.M.: Robust optimization of graph partitioning and critical node detection in analyzing networks. In: COCOA, 2010, pp. 170\u2013183 (2010)"},{"key":"9458_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-21708-5","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"B. Korte","year":"2000","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms. Springer, Berlin (2000)"},{"key":"9458_CR10","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0167-5060(08)70822-7","volume":"4","author":"L. Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz, L.: Graph theory and integer programming. Ann. Discrete Math. 4, 141\u2013158 (1979)","journal-title":"Ann. Discrete Math."},{"key":"9458_CR11","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.cor.2007.09.004","volume":"36","author":"T.C. Matisziw","year":"2009","unstructured":"Matisziw, T.C., Murray, A.T.: Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure. Comput. Oper. Res. 36, 16\u201326 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"9458_CR12","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/S0377-2217(03)00135-8","volume":"156","author":"Y.-S. Myung","year":"2004","unstructured":"Myung, Y.-S., Kim, H.-J.: A cutting plane algorithm for computing k-edge survivability of a network. Eur. J. Oper. Res. 156(3), 579\u2013589 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"9458_CR13","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.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3, 411\u2013430 (1990)","journal-title":"SIAM J. Discrete Math."},{"key":"9458_CR14","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1023\/A:1013819515732","volume":"22","author":"H.D. Sherali","year":"2002","unstructured":"Sherali, H.D., Fraticelli, B.M.: Enhancing RLT relaxations via a new class of semidefinite cuts. J.\u00a0Glob. Optim. 22, 233\u2013261 (2002)","journal-title":"J.\u00a0Glob. Optim."},{"key":"9458_CR15","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF00121304","volume":"2","author":"H.D. Sherali","year":"1992","unstructured":"Sherali, H.D., Tuncbilek, C.H.: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique. J. Glob. Optim. 2, 101\u2013112 (1992)","journal-title":"J. Glob. Optim."},{"key":"9458_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01100203","volume":"7","author":"H.D. Sherali","year":"1995","unstructured":"Sherali, H.D., Tuncbilek, C.H.: A reformulation-convexification approach for solving nonconvex quadratic programming problems. J. Glob. Optim. 7, 1\u201331 (1995)","journal-title":"J. Glob. Optim."},{"key":"9458_CR17","author":"H.D. Sherali","year":"2011","unstructured":"Sherali, H.D., Dalkiran, E., Desai, J.: Enhancing RLT-based relaxations for polynomial programming problems via a new class of \u03bd-semidefinite cuts. Comput. Optim. Appl. (2011). doi: 10.1007\/s10589-011-9425-z","journal-title":"Comput. Optim. Appl."},{"key":"9458_CR18","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1080\/07408170600729192","volume":"39","author":"J.C. Smith","year":"2007","unstructured":"Smith, J.C., Lim, C.: Algorithms for discrete and continuous multicommodity flow network interdiction problems. IIE Trans. 39, 15\u201326 (2007)","journal-title":"IIE Trans."},{"key":"9458_CR19","doi-asserted-by":"crossref","first-page":"934","DOI":"10.1287\/opre.12.6.934","volume":"12","author":"R. Wollmer","year":"1964","unstructured":"Wollmer, R.: Removing arcs from a network. Oper. Res. 12, 934\u2013940 (1964)","journal-title":"Oper. Res."},{"key":"9458_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0895-7177(93)90236-R","volume":"17","author":"R.K. Wood","year":"1993","unstructured":"Wood, R.K.: Deterministic network interdiction. Math. Comput. Model. 17, 1\u201318 (1993)","journal-title":"Math. Comput. Model."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-012-9458-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-012-9458-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-012-9458-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T10:24:26Z","timestamp":1561285466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-012-9458-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,9]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["9458"],"URL":"https:\/\/doi.org\/10.1007\/s10589-012-9458-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,9]]}}}