Risk-Averse Shortest Path Interdiction
暂无分享,去创建一个
[1] George L. Nemhauser,et al. An integer programming approach for linear programs with probabilistic constraints , 2007, Math. Program..
[2] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[3] Alan T. Murray,et al. Critical network infrastructure analysis: interdiction and system flow , 2007, J. Geogr. Syst..
[4] Alper Atamtürk,et al. Sequence Independent Lifting for Mixed-Integer Programming , 2004, Oper. Res..
[5] James R. Luedtke,et al. Branch-and-cut approaches for chance-constrained formulations of reliable network design problems , 2013, Mathematical Programming Computation.
[6] Elise Miller-Hooks,et al. Adaptive least-expected time paths in stochastic, time-varying transportation and data networks , 2001, Networks.
[7] R. Kevin Wood,et al. Shortest‐path network interdiction , 2002, Networks.
[8] John N. Tsitsiklis,et al. Stochastic shortest path problems with recourse , 1996, Networks.
[9] J. C. Smith,et al. Optimal Mixed-Integer Programming and Heuristic Methods for a Bilevel Stackelberg Product Introduction Game , 2006 .
[10] Ted K. Ralphs,et al. Integer and Combinatorial Optimization , 2013 .
[11] Siqian Shen,et al. Reformulation and cutting-plane approaches for solving two-stage optimization and network interdiction problems , 2011 .
[12] Alan Washburn,et al. Two-Person Zero-Sum Games for Network Interdiction , 1995, Oper. Res..
[13] James R. Luedtke. A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support , 2013, Mathematical Programming.
[14] David P. Morton,et al. Models for nuclear smuggling interdiction , 2007 .
[15] Garth P. McCormick,et al. Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems , 1976, Math. Program..
[16] David P. Morton,et al. Interdiction Models and Applications , 2013 .
[17] David L. Woodruff,et al. A decomposition algorithm applied to planning the interdiction of stochastic networks , 2005 .
[18] Martin W. P. Savelsbergh,et al. Lifted Cover Inequalities for 0-1 Integer Programs: Computation , 1998, INFORMS J. Comput..
[19] Gerald G. Brown,et al. Assessing and Improving Operational Resilience of Critical Infrastructures and Other Systems , 2014 .
[20] S. Travis Waller,et al. On the online shortest path problem with limited arc cost dependencies , 2002, Networks.
[21] David L. Woodruff,et al. Network Interdiction and Stochastic Integer Programming , 2013 .
[22] Churlzu Lim,et al. New product introduction against a predator: A bilevel mixed‐integer programming approach , 2009 .
[23] James R. Luedtke,et al. Chance-Constrained Binary Packing Problems , 2014, INFORMS J. Comput..
[24] H. Frank,et al. Shortest Paths in Probabilistic Graphs , 1969, Oper. Res..
[25] David P. Morton,et al. Stochastic Network Interdiction , 1998, Oper. Res..
[26] R. K. Wood,et al. Bilevel Network Interdiction Models: Formulations and Solutions , 2011 .
[27] Simge Küçükyavuz,et al. On mixing sets arising in chance-constrained programming , 2012, Math. Program..
[28] Jeff T. Linderoth,et al. Reformulation and sampling to solve a stochastic network interdiction problem , 2008, Networks.
[29] J. J. Martin. Distribution of the Time Through a Directed, Acyclic Network , 1965 .
[30] B. Golden. A problem in network interdiction , 1978 .
[31] J. C. Smith,et al. Algorithms for discrete and continuous multicommodity flow network interdiction problems , 2007 .
[32] Matthew D. Bailey,et al. Shortest path network interdiction with asymmetric information , 2008 .
[33] A. Shapiro,et al. Solving Chance-Constrained Stochastic Programs via Sampling and Integer Programming , 2008 .
[34] Richard D. Wollmer,et al. Removing Arcs from a Network , 1964 .
[35] Manfred W. Padberg. Technical Note - A Note on Zero-One Programming , 1975, Oper. Res..
[36] Minjiao Zhang,et al. Chance‐constrained multi‐terminal network design problems , 2015 .
[37] Manfred W. Padberg,et al. A Note on Zero-One Programming , 2016 .
[38] Alexander Schrijver,et al. On the history of the transportation and maximum flow problems , 2002, Math. Program..
[39] Mohammad Reza Meybodi,et al. Utilizing Distributed Learning Automata to Solve Stochastic Shortest Path Problems , 2006, Int. J. Uncertain. Fuzziness Knowl. Based Syst..