{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T04:29:32Z","timestamp":1748924972561,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,10,17]],"date-time":"2018-10-17T00:00:00Z","timestamp":1539734400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,10,17]],"date-time":"2018-10-17T00:00:00Z","timestamp":1539734400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-12-1-0103"],"award-info":[{"award-number":["FA9550-12-1-0103"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000147","name":"Division of Civil, Mechanical and Manufacturing Innovation","doi-asserted-by":"publisher","award":["CMMI-1404971"],"award-info":[{"award-number":["CMMI-1404971"]}],"id":[{"id":"10.13039\/100000147","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1007\/s10898-018-0714-2","type":"journal-article","created":{"date-parts":[[2018,10,17]],"date-time":"2018-10-17T07:14:26Z","timestamp":1539760466000},"page":"783-801","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the chance-constrained minimum spanning k-core problem"],"prefix":"10.1007","volume":"74","author":[{"given":"Juan","family":"Ma","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3490-4257","authenticated-orcid":false,"given":"Balabhaskar","family":"Balasundaram","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,17]]},"reference":[{"issue":"4","key":"714_CR1","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1287\/ijoc.1080.0266","volume":"20","author":"AK Andreas","year":"2008","unstructured":"Andreas, A.K., Smith, J.C.: Mathematical programming algorithms for two-path routing problems with reliability considerations. INFORMS J. Comput. 20(4), 553\u2013564 (2008)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"714_CR2","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s10898-007-9254-x","volume":"42","author":"AK Andreas","year":"2008","unstructured":"Andreas, A.K., Smith, J.C., K\u00fc\u00e7\u00fckyavuz, S.: Branch-and-price-and-cut algorithms for solving the reliable h-paths problem. J. Glob. Optim. 42(4), 443\u2013466 (2008)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"714_CR3","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1287\/ijoc.4.2.192","volume":"4","author":"A Balakrishnan","year":"1992","unstructured":"Balakrishnan, A., Altinkemer, K.: Using a hop-constrained model to generate alternative communication network design. ORSA J. Comput. 4(2), 192\u2013205 (1992)","journal-title":"ORSA J. Comput."},{"key":"714_CR4","unstructured":"Balasundaram, B.: Graph theoretic generalizations of clique: Optimization and extensions. Ph.D. thesis, Texas A&M University, College Station, Texas, USA (2007)"},{"issue":"4","key":"714_CR5","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.disopt.2010.05.001","volume":"7","author":"F Bendali","year":"2010","unstructured":"Bendali, F., Diarrassouba, I., Mahjoub, A., Mailfert, J.: The $$k$$ edge-disjoint 3-hop-constrained paths polytope. Discrete Optim. 7(4), 222\u2013233 (2010)","journal-title":"Discrete Optim."},{"key":"714_CR6","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1093\/imaman\/dpp005","volume":"21","author":"P Beraldi","year":"2010","unstructured":"Beraldi, P., Bruni, M.E., Guerriero, F.: Network reliability design via joint probabilistic constraints. IMA J. Manag. Math. 21, 213\u2013226 (2010)","journal-title":"IMA J. Manag. Math."},{"issue":"1","key":"714_CR7","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1287\/ijoc.1110.0472","volume":"25","author":"Q Botton","year":"2013","unstructured":"Botton, Q., Fortz, B., Gouveia, L., Poss, M.: Benders decomposition for the hop-constrained survivable network design problem. INFORMS J. Comput. 25(1), 13\u201326 (2013)","journal-title":"INFORMS J. Comput."},{"key":"714_CR8","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0167-7187(91)90015-D","volume":"9","author":"JK Brueckner","year":"1991","unstructured":"Brueckner, J.K., Spiller, P.T.: Competition and mergers in airline hub-and-spoke networks. Int. J. Ind. Organ. 9, 323\u2013342 (1991)","journal-title":"Int. J. Ind. Organ."},{"issue":"4","key":"714_CR9","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/s11590-012-0453-0","volume":"7","author":"M Carvalho","year":"2013","unstructured":"Carvalho, M., Sorokin, A., Boginski, V., Balasundaram, B.: Topology design for on-demand dual-path routing in wireless networks. Optim. Lett. 7(4), 695\u2013707 (2013)","journal-title":"Optim. Lett."},{"key":"714_CR10","unstructured":"Dave, D.B.: Patterns of freight flow and design of a less-than-truckload distribution network. Ph.D. thesis, Georgia Institute of Technology (2004)"},{"key":"714_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"issue":"3","key":"714_CR12","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0966-8349(96)00016-2","volume":"4","author":"P Jaillet","year":"1996","unstructured":"Jaillet, P., Song, G., Yu, G.: Airline network design and hub location problems. Locat. Sci. 4(3), 195\u2013212 (1996)","journal-title":"Locat. Sci."},{"issue":"1","key":"714_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.20072","volume":"46","author":"H Kerivin","year":"2005","unstructured":"Kerivin, H., Mahjoub, A.R.: Design of survivable networks: a survey. Networks 46(1), 1\u201321 (2005)","journal-title":"Networks"},{"key":"714_CR14","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.jom.2014.10.006","volume":"33\u201334","author":"Y Kim","year":"2015","unstructured":"Kim, Y., Chen, Y.S., Linderman, K.: Supply network disruption and resilience: a network structural perspective. J. Oper. Manag. 33\u201334, 43\u201359 (2015)","journal-title":"J. Oper. Manag."},{"issue":"2","key":"714_CR15","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1002\/net.21497","volume":"61","author":"AM Koster","year":"2013","unstructured":"Koster, A.M., Kutschka, M., Raack, C.: Robust network design: formulations, valid inequalities, and computations. Networks 61(2), 128\u2013149 (2013)","journal-title":"Networks"},{"issue":"1","key":"714_CR16","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10107-010-0385-3","volume":"132","author":"S K\u00fc\u00e7\u00fckyavuz","year":"2012","unstructured":"K\u00fc\u00e7\u00fckyavuz, S.: On mixing sets arising in chance-constrained programming. Math. Program. 132(1), 31\u201356 (2012)","journal-title":"Math. Program."},{"key":"714_CR17","doi-asserted-by":"publisher","unstructured":"Liu, X., K\u0131l\u0131n\u00e7-Karzan, F., K\u00fc\u00e7\u00fckyavuz, S.: On intersection of two mixing sets with applications to joint chance-constrained programs. Math. Program. (2018). \n                    https:\/\/doi.org\/10.1007\/s10107-018-1231-2","DOI":"10.1007\/s10107-018-1231-2"},{"key":"714_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-642-13036-6_21","volume-title":"Integer Programming and Combinatorial Optimization","author":"J Luedtke","year":"2010","unstructured":"Luedtke, J.: An integer programming and decomposition approach to general chance-constrained mathematical programs. In: Eisenbrand, F., Shepherd, F. (eds.) Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, vol. 6080, pp. 271\u2013284. Springer, Berlin (2010)"},{"issue":"1\u20132","key":"714_CR19","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10107-013-0684-6","volume":"146","author":"J Luedtke","year":"2014","unstructured":"Luedtke, J.: A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support. Math. Program. 146(1\u20132), 219\u2013244 (2014)","journal-title":"Math. Program."},{"issue":"2","key":"714_CR20","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10107-008-0247-4","volume":"12","author":"J Luedtke","year":"2010","unstructured":"Luedtke, J., Ahmed, S., Nemhauser, G.: An integer programming approach for linear programs with probabilistic constraints. Math. Program. 12(2), 247\u2013272 (2010)","journal-title":"Math. Program."},{"key":"714_CR21","unstructured":"Ma, J., Balasundaram, B.: Solving chance-constrained spanning $$k$$-core problem via decomposition and integer programming. In: Proceedings of the 2013 Industrial and Systems Engineering Research Conference (ISERC 2013), pp. 2774\u20132783. Institute of Industrial Engineers, Norcross, GA (2013)"},{"issue":"2","key":"714_CR22","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1287\/ijoc.2015.0679","volume":"28","author":"J Ma","year":"2016","unstructured":"Ma, J., Pajouh, F.M., Balasundaram, B., Boginski, V.: The minimum spanning $$k$$-core problem with bounded CVaR under probabilistic edge failures. INFORMS J. Comput. 28(2), 295\u2013307 (2016)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"714_CR23","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/net.20046","volume":"45","author":"TL Magnanti","year":"2005","unstructured":"Magnanti, T.L., Raghavan, S.: Strong formulations for network design problems with connectivity requirements. Networks 45(2), 61\u201379 (2005)","journal-title":"Networks"},{"issue":"2","key":"714_CR24","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1002\/net.21483","volume":"61","author":"AR Mahjoub","year":"2013","unstructured":"Mahjoub, A.R., Simonetti, L., Uchoa, E.: Hop-level flow formulation for the survivable network design with hop constraints problem. Networks 61(2), 171\u2013179 (2013)","journal-title":"Networks"},{"key":"714_CR25","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1002\/net.3230190305","volume":"19","author":"M Minoux","year":"1989","unstructured":"Minoux, M.: Network synthesis and optimum network design problems: models, solution methods, and applications. Networks 19, 313\u2013360 (1989)","journal-title":"Networks"},{"issue":"4","key":"714_CR26","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1287\/opre.37.4.531","volume":"37","author":"CL Monma","year":"1989","unstructured":"Monma, C.L., Shallcross, D.F.: Methods for designing communications networks with certain two-connected survivability constraints. Oper. Res. 37(4), 531\u2013541 (1989)","journal-title":"Oper. Res."},{"key":"714_CR27","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1999","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1999)"},{"issue":"1","key":"714_CR28","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0966-6923(94)90032-9","volume":"2","author":"ME O\u2019Kelly","year":"1994","unstructured":"O\u2019Kelly, M.E., Miller, H.J.: The hub network design problem: a review and synthesis. J. Transp. Geogr. 2(1), 31\u201340 (1994)","journal-title":"J. Transp. Geogr."},{"issue":"3","key":"714_CR29","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/s10878-012-9523-6","volume":"27","author":"G Pastukhov","year":"2014","unstructured":"Pastukhov, G., Veremyev, A., Boginski, V., Pasiliao, E.L.: Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks. J. Comb. Optim. 27(3), 462\u2013486 (2014)","journal-title":"J. Comb. Optim."},{"key":"714_CR30","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.cor.2015.09.008","volume":"67","author":"I Rodr\u00edguez-Mart\u00edn","year":"2016","unstructured":"Rodr\u00edguez-Mart\u00edn, I., Salazar-Gonz\u00e1lez, J.J., Yaman, H.: A branch-and-cut algorithm for two-level survivable network design problems. Comput. Oper. Res. 67, 102\u2013112 (2016)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"714_CR31","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman, S.B.: Network structure and minimum degree. Soc. Netw. 5(3), 269\u2013287 (1983)","journal-title":"Soc. Netw."},{"issue":"2","key":"714_CR32","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10898-006-9067-3","volume":"38","author":"JC Smith","year":"2007","unstructured":"Smith, J.C., Lim, C., Sudargho, F.: Survivable network design under optimal and heuristic interdiction scenarios. J. Glob. Optim. 38(2), 181\u2013199 (2007)","journal-title":"J. Glob. Optim."},{"issue":"4","key":"714_CR33","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s12532-013-0058-3","volume":"5","author":"Y Song","year":"2013","unstructured":"Song, Y., Luedtke, J.R.: Branch-and-cut approaches for chance-constrained formulations of reliable network design problems. Math. Program. Comput. 5(4), 397\u2013432 (2013)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"714_CR34","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s10878-011-9422-2","volume":"25","author":"A Sorokin","year":"2013","unstructured":"Sorokin, A., Boginski, V., Nahapetyan, A., Pardalos, P.M.: Computational risk management techniques for fixed charge network flow problems with uncertain arc failures. J. Comb. Optim. 25(1), 99\u2013122 (2013)","journal-title":"J. Comb. Optim."},{"key":"714_CR35","first-page":"137","volume-title":"Dynamics of Information Systems: Mathematical Foundations, Springer Proceedings in Mathematics & Statistics","author":"A Veremyev","year":"2012","unstructured":"Veremyev, A., Boginski, V.: Robustness and strong attack tolerance of low-diameter networks. In: Sorokin, A., Murphey, R., Thai, M.T., Pardalos, P.M. (eds.) Dynamics of Information Systems: Mathematical Foundations, Springer Proceedings in Mathematics & Statistics, vol. 20, pp. 137\u2013156. Springer, New York (2012)"},{"issue":"9","key":"714_CR36","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1080\/0740817X.2014.991476","volume":"47","author":"QP Zheng","year":"2015","unstructured":"Zheng, Q.P., Shen, S., Shi, Y.: Loss-constrained minimum cost flow under arc failure uncertainty with applications in risk-aware kidney exchange. IIE Trans. 47(9), 961\u2013977 (2015)","journal-title":"IIE Trans."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-0714-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-018-0714-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-0714-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T07:31:06Z","timestamp":1589700666000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-018-0714-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,17]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["714"],"URL":"https:\/\/doi.org\/10.1007\/s10898-018-0714-2","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2018,10,17]]},"assertion":[{"value":"17 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 October 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}