{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T12:00:42Z","timestamp":1777118442883,"version":"3.51.4"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,10,21]],"date-time":"2011-10-21T00:00:00Z","timestamp":1319155200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2013,1]]},"DOI":"10.1007\/s10878-011-9422-2","type":"journal-article","created":{"date-parts":[[2011,10,20]],"date-time":"2011-10-20T12:37:45Z","timestamp":1319114265000},"page":"99-122","source":"Crossref","is-referenced-by-count":9,"title":["Computational risk management techniques for fixed charge network flow problems with uncertain arc failures"],"prefix":"10.1007","volume":"25","author":[{"given":"Alexey","family":"Sorokin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir","family":"Boginski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Artyom","family":"Nahapetyan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,10,21]]},"reference":[{"key":"9422_CR1","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.69.025103","volume":"69","author":"R Albert","year":"2004","unstructured":"Albert R, Albert I, Nakarado G (2004) Structural vulnerability of the North American power grid. Phys Rev E 69:025103","journal-title":"Phys Rev E"},{"key":"9422_CR2","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1287\/opre.1070.0428","volume":"55","author":"A Atamturk","year":"2007","unstructured":"Atamturk A, Zhang M (2007) Two-stage robust network flow and design under demand uncertainty. Oper Res 55:662\u2013673","journal-title":"Oper Res"},{"key":"9422_CR3","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1287\/opre.37.5.716","volume":"37","author":"A Balakrishnan","year":"1989","unstructured":"Balakrishnan A, Magnanti TL, Wong RT (1989) A dual-ascent procedure for large-scale uncapacitated network design. Oper Res 37:716\u2013740","journal-title":"Oper Res"},{"key":"9422_CR4","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1287\/opre.29.3.448","volume":"29","author":"R Barr","year":"1981","unstructured":"Barr R, Glover F, Klingman D (1981) A new optimization method for large scale fixed charge transportation problems. Oper Res 29:448\u2013463","journal-title":"Oper Res"},{"key":"9422_CR5","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/s11590-009-0125-x","volume":"3","author":"V Boginski","year":"2009","unstructured":"Boginski V, Commander C, Turko T (2009) Polynomial-time identification of robust network flows under uncertain arc failures. Optim Lett 3:461\u2013473","journal-title":"Optim Lett"},{"key":"9422_CR6","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/nav.3800310115","volume":"31","author":"A Cabot","year":"1984","unstructured":"Cabot A, Erenguc S (1984) Some branch-and-bound procedures for fixed-cost transportation problems. Nav Res Logist Q 31:145\u2013154","journal-title":"Nav Res Logist Q"},{"key":"9422_CR7","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/s10878-007-9071-7","volume":"14","author":"C Commander","year":"2006","unstructured":"Commander C, Pardalos PM, Ryabchenko V, Uryasev S (2006) The wireless network jamming problem. J Comb Optim 14:481\u2013498","journal-title":"J Comb Optim"},{"key":"9422_CR8","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1002\/nav.3800140110","volume":"8","author":"L Cooper","year":"1967","unstructured":"Cooper L, Drebes C (1967) An approximate solution method for the fixed charge problem. Nav Res Logist Q 8:101\u2013113","journal-title":"Nav Res Logist Q"},{"key":"9422_CR9","doi-asserted-by":"crossref","first-page":"1429","DOI":"10.1016\/j.cor.2003.11.012","volume":"32","author":"AM Costa","year":"2005","unstructured":"Costa AM (2005) A survey on benders decomposition applied to fixed-charge network. Comput Oper Res 32:1429\u20131450","journal-title":"Comput Oper Res"},{"key":"9422_CR10","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0305-0548(98)80010-5","volume":"25","author":"FRB Cruz","year":"1998","unstructured":"Cruz FRB, Smith JM, Mateus GR (1998) Solving to optimality the uncapacitated fixed-charge network flow problem. Comput Oper Res 25:67\u201381","journal-title":"Comput Oper Res"},{"key":"9422_CR11","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1002\/nav.3800160311","volume":"16","author":"D Denzler","year":"1969","unstructured":"Denzler D (1969) An approximate algorithm for the fixed charge problem. Nav Res Logist Q 16:411\u2013416","journal-title":"Nav Res Logist Q"},{"key":"9422_CR12","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1002\/net.10082","volume":"42","author":"J Geunes","year":"2003","unstructured":"Geunes J, Pardalos PM (2003) Network optimization in supply chain management and financial engineering: an annotated bibliography. Networks 42:66\u201384","journal-title":"Networks"},{"key":"9422_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/b137269","volume-title":"Supply chain optimization","author":"J Geunes","year":"2005","unstructured":"Geunes J, Pardalos PM (2005) Supply chain optimization. Springer, Berlin"},{"key":"9422_CR14","doi-asserted-by":"crossref","first-page":"1529","DOI":"10.1287\/opre.19.6.1529","volume":"19","author":"P Gray","year":"1971","unstructured":"Gray P (1971) Exact solution for the fixed-charge transportation problem. Oper Res 19:1529\u20131538","journal-title":"Oper Res"},{"key":"9422_CR15","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1109\/FOCS.2004.11","volume-title":"Proceedings of the 45th annual IEEE symposium on foundations of computer science","author":"A Gupta","year":"2004","unstructured":"Gupta A, Ravi R, Sinha A (2004) An edge in time saves nine: LP rounding approximation algorithms for stochastic network design. In: Proceedings of the 45th annual IEEE symposium on foundations of computer science, pp 218\u2013227"},{"key":"9422_CR16","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1287\/ijoc.1090.0348","volume":"22","author":"M Hewitt","year":"2010","unstructured":"Hewitt M, Nemhauser GL, Savelsbergh WP (2010) Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem. INFORMS J Comput 22:314\u2013325","journal-title":"INFORMS J Comput"},{"key":"9422_CR17","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1002\/nav.3800150306","volume":"15","author":"WM Hirsch","year":"1968","unstructured":"Hirsch WM, Dantzig GM (1968) The fixed charge problem. Nav Res Logist Q 15:413\u2013424","journal-title":"Nav Res Logist Q"},{"key":"9422_CR18","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1287\/mnsc.22.10.1116","volume":"22","author":"JL Kennington","year":"1976","unstructured":"Kennington JL, Unger V (1976) A new branch-and-bound algorithm for the fixed charge transportation problem. Manag Sci 22:1116\u20131126","journal-title":"Manag Sci"},{"key":"9422_CR19","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1287\/ijoc.1090.0354","volume":"22","author":"JL Kennington","year":"2010","unstructured":"Kennington JL, Nicholson CD (2010) The uncapacitated time-space fixed-charge network flow problem: an empirical investigation of procedures for arc capacity assignment. INFORMS J Comput 22:326\u2013337","journal-title":"INFORMS J Comput"},{"key":"9422_CR20","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0167-6377(99)00004-8","volume":"24","author":"D Kim","year":"1999","unstructured":"Kim D, Pardalos PM (1999) A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. Oper Res Lett 24:195\u2013203","journal-title":"Oper Res Lett"},{"key":"9422_CR21","doi-asserted-by":"crossref","first-page":"1469","DOI":"10.1080\/14697680701458307","volume":"7","author":"PA Krokhmal","year":"2007","unstructured":"Krokhmal PA (2007) Higher moment coherent risk measures. Quant Finance 7:1469\u20137688","journal-title":"Quant Finance"},{"key":"9422_CR22","first-page":"11","volume":"4","author":"P Krokhmal","year":"2002","unstructured":"Krokhmal P, Palmquist J, Uryasev S (2002) Portfolio optimization with conditional value-at-risk objective and constraints. J Risk 4:11\u201327","journal-title":"J Risk"},{"key":"9422_CR23","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1287\/opre.16.2.268","volume":"16","author":"KG Murty","year":"1968","unstructured":"Murty KG (1968) Solving the fixed charge problem by ranking the extreme points. Oper Res 16:268\u2013279","journal-title":"Oper Res"},{"key":"9422_CR24","doi-asserted-by":"crossref","first-page":"71","DOI":"10.3934\/jimo.2007.3.71","volume":"3","author":"A Nahapetyan","year":"2007","unstructured":"Nahapetyan A, Pardalos PM (2007) A bilinear relaxation based algorithm for concave piecewise linear network flow problems. J Ind Manag Optim 3:71\u201385","journal-title":"J Ind Manag Optim"},{"key":"9422_CR25","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10589-007-9060-x","volume":"39","author":"A Nahapetyan","year":"2008","unstructured":"Nahapetyan A, Pardalos PM (2008) Adaptive dynamic cost updating procedure for solving fixed charge network flow problems. Comput Optim Appl 39:37\u201350","journal-title":"Comput Optim Appl"},{"key":"9422_CR26","volume-title":"Series in discrete mathematics and optimization","author":"G Nemhauser","year":"1999","unstructured":"Nemhauser G, Wolsey GL (1999) Integer and combinatorial optimization. In: Series in discrete mathematics and optimization. Wiley-Interscience, New York"},{"key":"9422_CR27","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1002\/net.10068","volume":"41","author":"F Ortega","year":"2003","unstructured":"Ortega F, Wolsey L (2003) A branch-and-cut algorithm for the single commodity uncapacitated fixed charge network flow problem. Networks 41:143\u2013158","journal-title":"Networks"},{"key":"9422_CR28","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/trsc.20.2.117","volume":"20","author":"W Powell","year":"1986","unstructured":"Powell W (1986) Stochastic model of the dynamic vehicle allocation problem. Transp Sci 20:117\u2013129","journal-title":"Transp Sci"},{"key":"9422_CR29","doi-asserted-by":"crossref","first-page":"1443","DOI":"10.1016\/S0378-4266(02)00271-6","volume":"26","author":"RT Rockafellar","year":"2002","unstructured":"Rockafellar RT, Uryasev S (2002) Conditional value-at-risk for general loss distributions. J Bank Finance 26:1443\u20131471","journal-title":"J Bank Finance"},{"key":"9422_CR30","doi-asserted-by":"crossref","first-page":"21","DOI":"10.21314\/JOR.2000.038","volume":"3","author":"RT Rockafellar","year":"2000","unstructured":"Rockafellar RT, Uryasev S (2000) Optimization of conditional value-at-risk. J Risk 3:21\u201341","journal-title":"J Risk"},{"key":"9422_CR31","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/nav.3800170209","volume":"17","author":"DI Steinberg","year":"1970","unstructured":"Steinberg DI (1970) The fixed charge problem. Nav Res Logist Q 17:217\u2013235","journal-title":"Nav Res Logist Q"},{"key":"9422_CR32","first-page":"457","volume-title":"Lecture notes in economics and mathematical systems","author":"P Tsamasphyrou","year":"2000","unstructured":"Tsamasphyrou P, Renaud A, Carpentier P (2000) Transmission network planning under uncertainty with Benders decomposition. In: Lecture notes in economics and mathematical systems, pp 457\u2013468"},{"key":"9422_CR33","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1111\/j.1467-8667.2006.00465.x","volume":"22","author":"S Ukkusuri","year":"2007","unstructured":"Ukkusuri S, Mathew T, Waller T (2007) Robust transportation network design under demand uncertainty. Comput-Aided Civ Infrastruct Eng 22:6\u201318","journal-title":"Comput-Aided Civ Infrastruct Eng"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9422-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9422-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9422-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:16Z","timestamp":1559262196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9422-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,21]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["9422"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9422-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10,21]]}}}