The Minimum Spanning k-Core Problem with Bounded CVaR Under Probabilistic Edge Failures

References

• Ahmed S (2006) Convexity and decomposition of mean-risk stochastic programs. Math. Programming 106:433–446.Crossref, Google Scholar
• Anstee RP (1987) A polynomial algorithm for b-matchings: An alternative approach. Inform. Processing Lett. 24:153–157.Crossref, Google Scholar
• Artzner P, Delbaen F, Eber J-M, Heath D (1999) Coherent measures of risk. Math. Finance 9:203–228.Crossref, Google Scholar
• Aykin T (1994) Lagrangean relaxation based approaches to capacitated hub-and-spoke network design problem. Eur. J. Operational Res. 79:501–523.Crossref, Google Scholar
• Balasundaram B (2007) Graph theoretic generalizations of clique: Optimization and extensions. Doctoral thesis, Texas A&M University, College Station, TX.Google Scholar
• Balasundaram B, Butenko S (2006) Graph domination, coloring and cliques in telecommunications. Resende MGC, Pardalos PM, eds. Handbook of Optimization in Telecommunications (Springer Science + Business Media, New York), 865–890.Crossref, Google Scholar
• Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4:238–252.Crossref, Google Scholar
• Bertsimas D, Sim M (2004) The price of robustness. Oper. Res. 52:35–53.Link, Google Scholar
• Bertsimas D, Brown DB, Caramanis C (2011) Theory and applications of robust optimization. SIAM Rev. 53:464–501.Crossref, Google Scholar
• Birge JR, Louveaux F (1997) Introduction to Stochastic Programming (Springer, New York).Google Scholar
• Botton Q, Fortz B, Gouveia L, Poss M (2013) Benders decomposition for the hop-constrained survivable network design problem. INFORMS J. Comput. 25:13–26.Link, Google Scholar
• Brueckner JK, Spiller PT (1991) Competition and mergers in airline hub-and-spoke networks. Internat. J. Indust. Organ. 9:323–342.Crossref, Google Scholar
• Butenko S, Cheng X, Du D-Z, Pardalos P (2003) On the construction of virtual backbone for ad hoc wireless networks. Butenko S, Murphey R, Pardalos PM, eds. Cooperative Control: Models, Applications and Algorithms (Kluwer Academic Publisher, Dordrecht, Netherlands), 43–54.Crossref, Google Scholar
• Cook W, Pulleyblank WR (1987) Linear systems for constrained matching problems. Math. Oper. Res. 12:97–120.Link, Google Scholar
• Dahl G, Huygens D, Mahjoub AR, Pesneau P (2006) On the edge-disjoint 2-hop-constrained paths polytope. Oper. Res. Lett. 34:577–582.Crossref, Google Scholar
• Fábián CI (2008) Handling CVaR objectives and constraints in two-stage stochastic models. Eur. J. Operational Res. 191:888–911.Crossref, Google Scholar
• Haneveld W, van der Vlerk M (2006) Integrated chance constraints: Reduced forms and an algorithm. Computational Management Sci. 3:245–269.Crossref, Google Scholar
• Hansson T, Ringbeck J, Franke M (2002) Fight for survival: A new operating model for airlines. White paper, Booz Allen Hamilton. Accessed February 22, 2016, http://www.boozallen.com/content/dam/boozallen/media/file/Flight_for_Survival_airlines.pdf.Google Scholar
• Hong LJ, Liu G (2009) Simulating sensitivities of conditional value at risk. Management Sci. 55:281–293.Link, Google Scholar
• Huang P, Subramanian D (2012) Iterative estimation maximization for stochastic linear programs with conditional value-at-risk constraints. Comput. Management Sci. 9:441–458.Crossref, Google Scholar
• Huang P, Subramanian D, Xu J (2010) An importance sampling method for portfolio CVaR estimation with Gaussian copula models. Proc. Winter Simulation Conf., Baltimore, 2790–2800.Crossref, Google Scholar
• Huygens D, Mahjoub AR, Pesneau P (2004) Two edge-disjoint hop-constrained paths and polyhedra. SIAM J. Discrete Math. 18:287–312.Crossref, Google Scholar
• Jenkins D, ed. (2004) Southwest Airlines: An In-Depth Review (Embry-Riddle Aeronautical University, Daytona Beach, FL).Google Scholar
• Krokhmal P, Palmquist J, Uryasev S (2002) Portfolio optimization with conditional value-at-risk objective and constraints. J. Risk 4:43–68.Crossref, Google Scholar
• Krokhmal P, Uryasev S, Zrazhevsky G (2005) Numerical comparison of conditional value-at-risk and conditional drawdown-at-risk approaches: Application to hedge funds. Wallace SW, Ziemba WT, eds. Applications of Stochastic Programming, MPS/SIAM Ser. Optim., Vol. 5 (SIAM, Philadelphia), 609–631.Crossref, Google Scholar
• Künzi-Bay A, Mayer J (2006) Computational aspects of minimizing conditional value-at-risk. Comput. Management Sci. 3:3–27.Crossref, Google Scholar
• Luedtke J (2010) An integer programming and decomposition approach to general chance-constrained mathematical programs. Eisenbrand F, Shepherd F, eds. Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, Vol. 6080 (Springer, Berlin/Heidelberg), 271–284.Crossref, Google Scholar
• Ma J, Balasundaram B (2013) Solving chance-constrained spanning k-core problem via decomposition and integer programming. Proc. 2013 Industrial Systems Engrg. Research Conf., Norcross, GA, 2774–2783.Google Scholar
• Mahjoub AR, Simonetti L, Uchoa E (2013) Hop-level flow formulation for the survivable network design with hop constraints problem. Networks 61:171–179.Crossref, Google Scholar
• Monma CL, Shallcross DF (1989) Methods for designing communications networks with certain two-connected survivability constraints. Oper. Res. 37:531–541.Link, Google Scholar
• Nero G (1999) A note on the competitive advantage of large hub-and-spoke networks. Transportation Res. Part E 35:225–239.Crossref, Google Scholar
• O’Kelly ME, Miller HJ (1994) The hub network design problem: A review and synthesis. J. Transport Geography 2:31–40.Crossref, Google Scholar
• Pastukhov G, Veremyev A, Boginski V, Pasiliao EL (2014) Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks. J. Combinatorial Optim. 27:462–486.Crossref, Google Scholar
• Pattillo J, Youssef N, Butenko S (2013) On clique relaxation models in network analysis. Eur. J. Operational Res. 226:9–18.Crossref, Google Scholar
• Pflug GC (2000) Some remarks on the value-at-risk and the conditional value-at-risk. Nonconvex Optim. Appl. 49:272–281.Crossref, Google Scholar
• Prékopa A (2003) Probabilistic programming. Ruszczynski A, Shapiro A, eds. Stochastic Programming: Handbooks in Operations Research and Management Science, Vol. 10 (Elsevier, Amsterdam), 267–351.Crossref, Google Scholar
• Pulleyblank WR (1973) Faces of matching polyhedra. Doctoral thesis, University of Waterloo, Canada.Google Scholar
• Rockafellar R, Uryasev S (2002) Conditional value-at-risk for general loss distributions. J. Banking Finance 26:1443–1471.Crossref, Google Scholar
• Rockafellar RT, Uryasev S (2000) Optimization of conditional value-at-risk. J. Risk 2:21–41.Crossref, Google Scholar
• Seidman SB (1983) Network structure and minimum degree. Soc. Networks 5:269–287.Crossref, Google Scholar
• Shapiro A, Dentcheva D, Ruszczynski A (2009) Lectures on Stochastic Programming: Modeling and Theory (Society for Industrial and Applied Mathematics, Philadelphia).Crossref, Google Scholar
• Shen S, Smith JC, Ahmed S (2010) Expectation and chance-constrained models and algorithms for insuring critical paths. Management Sci. 56:1794–1814.Link, Google Scholar
• Steiglitz K, Weiner P, Kleitman D (1969) The design of minimum-cost survivable networks. IEEE Trans. Circuit Theory 16:455–460.Crossref, Google Scholar
• Subramanian D, Huang P (2009) An efficient decomposition algorithm for static, stochastic, linear and mixed-integer linear programs with conditional value-at-risk constraints. Technical Report RC24752, IBM Thomas J. Watson Research Center, Yorktown Heights, NY.Google Scholar
• Van Slyke R, Wets RJ-B (1969) L-shaped linear programs with applications to control and stochastic programming. SIAM J. Appl. Math. 17:638–663.Crossref, Google Scholar
• Veremyev A, Boginski V (2012) Robustness and strong attack tolerance of low-diameter networks. Sorokin A, Murphey R, Thai MT, Pardalos PM, eds. Dynamics of Information Systems: Mathematical Foundations, Springer Proceedings in Mathematics and Statistics, Vol. 20 (Springer, New York), 137–156.Crossref, Google Scholar
• Wang W (2007) Sample average approximation of risk-averse stochastic programs. Doctoral thesis, Georgia Institute of Technology, Atlanta.Google Scholar
• Wang W, Ahmed S (2008) Sample average approximation of expected value constrained stochastic programs. Oper. Res. Lett. 36:515–519.Crossref, Google Scholar
• West D (2001) Introduction to Graph Theory (Prentice-Hall, Upper Saddle River, NJ).Google Scholar