A cutting plane method for risk-constrained traveling salesman problem with random arc costs
暂无分享,去创建一个
Tao Zhang | Eduardo L. Pasiliao | Vladimir Boginski | Qipeng P. Zheng | Zhouchun Huang | E. Pasiliao | Q. Zheng | V. Boginski | Zhouchun Huang | Tao Zhang
[1] Mehmet Tolga Çezik,et al. Cuts for mixed 0-1 conic programming , 2005, Math. Program..
[2] Sergey Sarykalin,et al. Value-at-Risk vs. Conditional Value-at-Risk in Risk Management and Optimization , 2008 .
[3] Timo Leipälä,et al. On the solutions of stochastic traveling salesman problems , 1978 .
[4] András Prékopa,et al. ON PROBABILISTIC CONSTRAINED PROGRAMMING , 2015 .
[5] James R. Luedtke,et al. A Sample Approximation Approach for Optimization with Probabilistic Constraints , 2008, SIAM J. Optim..
[6] John R. Birge,et al. Stochastic programming approaches to stochastic scheduling , 1996, J. Glob. Optim..
[7] Jianhui Wang,et al. Stochastic Optimization for Unit Commitment—A Review , 2015, IEEE Transactions on Power Systems.
[8] Xiao Luo,et al. Distributionally robust chance constrained optimization for economic dispatch in renewable energy integrated systems , 2018, J. Glob. Optim..
[9] Laurence A. Wolsey,et al. Covering Linear Programming with Violations , 2014, INFORMS J. Comput..
[10] Moshe Sniedovich,et al. Technical Note - Analysis of a Preference Order Traveling Salesman Problem , 1981, Oper. Res..
[11] James R. Luedtke. An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programs , 2010, IPCO.
[12] Yurii Nesterov,et al. Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.
[13] Paolo Toth,et al. Models and algorithms for the Asymmetric Traveling Salesman Problem: an experimental comparison , 2012, EURO J. Transp. Logist..
[14] Q. Zheng,et al. Loss-constrained minimum cost flow under arc failure uncertainty with applications in risk-aware kidney exchange , 2015 .
[15] Gregory Gutin,et al. The traveling salesman problem , 2006, Discret. Optim..
[16] Alan M. Frieze. On Random Symmetric Travelling Salesman Problems , 2004, Math. Oper. Res..
[17] Barrett W. Thomas,et al. Probabilistic Traveling Salesman Problem with Deadlines , 2008, Transp. Sci..
[18] G. Laporte. The traveling salesman problem: An overview of exact and approximate algorithms , 1992 .
[19] D. Duffie,et al. An Overview of Value at Risk , 1997 .
[20] Richard M. Karp,et al. A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem , 1979, SIAM J. Comput..
[21] Alexander Shapiro,et al. Sample Average Approximation Method for Chance Constrained Programming: Theory and Applications , 2009, J. Optimization Theory and Applications.
[22] Alejandro Toriello,et al. A Dynamic Traveling Salesman Problem with Stochastic Arc Costs , 2014, Oper. Res..
[23] J. E. Kelley,et al. The Cutting-Plane Method for Solving Convex Programs , 1960 .
[24] Barbara J. Lence,et al. Surface water quality management using a multiple‐realization chance constraint method , 1999 .
[25] William M. Springer. Review of the traveling salesman problem: a computational study by Applegate, Bixby, Chvátal, and Cook (Princeton University Press) , 2009, SIGA.
[26] Edward P. C. Kao,et al. A Preference Order Dynamic Program for a Stochastic Traveling Salesman Problem , 1978, Oper. Res..
[27] Joel Cord,et al. A Method for Allocating Funds to Investment Projects when Returns are Subject to Uncertainty , 1964 .
[28] Sanjay Mehrotra,et al. Generating Convex Polynomial Inequalities for Mixed 0–1 Programs , 2002, J. Glob. Optim..
[29] Alan M. Frieze,et al. The probabilistic relationship between the assignment and asymmetric traveling salesman problems , 2001, SODA '01.
[30] Patrick Jaillet,et al. A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited , 1988, Oper. Res..
[31] Bo Zeng,et al. Chance Constrained Mixed Integer Program: Bilinear and Linear Formulations, and Benders Decomposition , 2014, 1403.7875.
[32] R. Rockafellar,et al. Optimization of conditional value-at risk , 2000 .
[33] Ryuhei Miyashiro,et al. Mixed integer second-order cone programming formulations for variable selection in linear regression , 2015, Eur. J. Oper. Res..
[34] A. Charnes,et al. Cost Horizons and Certainty Equivalents: An Approach to Stochastic Programming of Heating Oil , 1958 .
[35] Rüdiger Schultz,et al. Conditional Value-at-Risk in Stochastic Programs with Mixed-Integer Recourse , 2006, Math. Program..
[36] Alper Atamtürk,et al. Conic mixed-integer rounding cuts , 2009, Math. Program..
[37] W. Krauth,et al. The Cavity Method and the Travelling-Salesman Problem , 1989 .
[38] Madan Lal Mittal,et al. Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches , 2010 .
[39] Thomas L. Morin,et al. Generalized Dynamic Programming for Stochastic Combinatorial Optimization , 1989, Oper. Res..
[40] David Simchi-Levi,et al. The Traveling Salesman Location Problem on Stochastic Networks , 1989, Transp. Sci..
[41] H. P. Williams,et al. A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem , 2007 .
[42] Biao Huang,et al. Robust optimization approximation for joint chance constrained optimization problem , 2016, Journal of Global Optimization.
[43] Alexander Shapiro,et al. The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study , 2003, Comput. Optim. Appl..
[44] A. Schrijver. On the History of Combinatorial Optimization (Till 1960) , 2005 .
[45] Eduardo L. Pasiliao,et al. Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios , 2016, Annals of Operations Research.
[46] Itay Gurvich,et al. Staffing Call Centers with Uncertain Demand Forecasts: A Chance-Constrained Optimization Approach , 2010, Manag. Sci..
[47] David P. Morton,et al. Stochastic Vehicle Routing with Random Travel Times , 2003, Transp. Sci..
[48] William J. Cook,et al. The Traveling Salesman Problem: A Computational Study , 2007 .
[49] Gilbert Laporte,et al. A Priori Optimization of the Probabilistic Traveling Salesman Problem , 1994, Oper. Res..
[50] William J. Cook,et al. Solution of a Large-Scale Traveling-Salesman Problem , 1954, 50 Years of Integer Programming.