Classical and Non-Classical Stochastic Recourse Programs with Applications in Telecommunications

[1]  Roger J.-B. Wets,et al.  Computing Bounds for Stochastic Programming Problems by Means of a Generalized Moment Problem , 1987, Math. Oper. Res..

[2]  Werner Römisch,et al.  Distribution sensitivity in stochastic programming , 1991, Math. Program..

[3]  Rüdiger Schultz.  Continuity and Stability in Two-Stage Stochastic Integer Programming , 1992 .

[4]  Prakash Mirchandani.  Projections of the capacitated network loading problem , 2000, Eur. J. Oper. Res..

[5]  Leen Stougie,et al.  Convex approximations for simple integer recourse models by perturbing the underlying distributions. , 1997 .

[6]  Morten Riis,et al.  Internet protocol network design with uncertain demand , 2005, J. Oper. Res. Soc..

[7]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[8]  Alexander Shapiro,et al.  Quantitative stability in stochastic programming , 1994, Math. Program..

[9]  Rudiger Schultz,et al.  Unit Commitment under Uncertainty via Two-Stage Stochastic Programming , 1997 .

[10]  Michèle Breton,et al.  Algorithms for the solution of stochastic dynamic minimax problems , 1995, Comput. Optim. Appl..

[11]  K. Onaga,et al.  On feasibility conditions of multicommodity flows in networks , 1971 .

[12]  Zvi Artstein,et al.  Stability Results for Stochastic Programs and Sensors, Allowing for Discontinuous Objective Functions , 1994, SIAM J. Optim..

[13]  John R. Birge,et al.  Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs , 1985, Oper. Res..

[14]  Robert D. Doverspike,et al.  Network planning with random demand , 1994, Telecommun. Syst..

[15]  Andrzej Ruszczynski,et al.  On augmented Lagrangian decomposition methods for multistage stochastic programs , 1996, Ann. Oper. Res..

[16]  Wlodzimierz Ogryczak,et al.  On consistency of stochastic dominance and mean–semideviation models , 2001, Math. Program..

[17]  A. Ruszczynski,et al.  Accelerating the regularized decomposition method for two stage stochastic linear problems , 1997 .

[18]  Werner Römisch,et al.  Obtaining convergence rates for approximations in stochastic programming , 1987 .

[19]  Claus C. Carøe,et al.  A cutting-plane approach to mixed 0-1 stochastic integer programs , 1997 .

[20]  Werner Römisch,et al.  Lipschitz Stability for Stochastic Programs with Complete Recourse , 1996, SIAM J. Optim..

[21]  Robert J. Vanderbei,et al.  Robust Optimization of Large-Scale Systems , 1995, Oper. Res..

[22]  Gilbert Laporte,et al.  The integer L-shaped method for stochastic integer programs with complete recourse , 1993, Oper. Res. Lett..

[23]  R. Wets.  Solving stochastic programs with simple recourse , 1983 .

[24]  Morten Riis,et al.  Capacitated Network Design with Uncertain Demand , 2002, INFORMS J. Comput..

[25]  R. Rao,et al.  Normal Approximation and Asymptotic Expansions , 1976 .

[26]  B. WETSt,et al.  STOCHASTIC PROGRAMS WITH FIXED RECOURSE : THE EQUIVALENT DETERMINISTIC PROGRAM , 2022 .

[27]  G. Laporte,et al.  EXACT SOLUTION OF A STOCHASTIC LOCATION PROBLEM BY AN INTEGER L-SHAPED ALGORITHM , 1990 .

[28]  Andrey I. Kibzun,et al.  Stochastic Programming Problems with Probability and Quantile Functions , 1996 .

[29]  Rüdiger Schultz.  On structure and stability in stochastic programs with random technology matrix and complete integer recourse , 1995, Math. Program..

[30]  Georg Ch. Pflug,et al.  A branch and bound method for stochastic global optimization , 1998, Math. Program..

[31]  Andrzej Ruszczynski.  Some advances in decomposition methodsfor stochastic linear programming , 1999, Ann. Oper. Res..

[32]  Ralph E. Gomory,et al.  The Theory and Computation of Knapsack Functions , 1966, Oper. Res..

[33]  Oktay Günlük,et al.  A branch-and-cut algorithm for capacitated network design problems , 1999, Math. Program..

[34]  Alexander Shapiro,et al.  Minimax analysis of stochastic problems , 2002, Optim. Methods Softw..

[35]  J. Hoffmann-jorgensen,et al.  Probability with a View Toward Statistics , 1994 .

[36]  George B. Dantzig,et al.  Linear Programming Under Uncertainty , 2004, Manag. Sci..

[37]  M. Stoer,et al.  A polyhedral approach to multicommodity survivable network design , 1994 .

[38]  S. M. Robinson,et al.  Stability in two-stage stochastic programming , 1987 .

[39]  Peter Kall,et al.  An upper bound for SLP using first and total second moments , 1991, Ann. Oper. Res..

[40]  R. Dudley.  Probabilities and metrics : convergence of laws on metric spaces, with a view to statistical testing , 1976 .

[41]  Leen Stougie,et al.  On the convex hull of the simple integer recourse objective function , 1995, Ann. Oper. Res..

[42]  Michael E. Theologou,et al.  Design of the Access Network Segment of Future Mobile Communications Systems , 1999, Wirel. Pers. Commun..

[43]  Di Yuan,et al.  Optimization of Internet Protocol network design and routing , 2004, Networks.

[44]  Jørgen Tind,et al.  L-shaped decomposition of two-stage stochastic programs with integer recourse , 1998, Math. Program..

[45]  David L. Woodruff,et al.  Progressive hedging and tabu search applied to mixed integer (0,1) multistage stochastic programming , 1996, J. Heuristics.

[46]  Julia L. Higle,et al.  Stochastic Decomposition: A Statistical Method for Large Scale Stochastic Linear Programming , 1996 .

[47]  Diethard Klatte,et al.  On Procedures for Analysing Parametric Optimization Problems , 1982 .

[48]  C. Givens,et al.  A class of Wasserstein metrics for probability distributions. , 1984 .

[49]  Andrzej Ruszczynski,et al.  A regularized decomposition method for minimizing a sum of polyhedral functions , 1986, Math. Program..

[50]  M. Chapman Findlay,et al.  Stochastic dominance : an approach to decision-making under risk , 1978 .

[51]  Michael A. H. Dempster,et al.  A stochastic programming approach to network planning , 1997 .

[52]  Charles E. Blair,et al.  The value function of a mixed integer program: I , 1977, Discret. Math..

[53]  Gautam Mitra,et al.  Computational solution of capacity planning models under uncertainty , 2000, Parallel Comput..

[54]  Thomas L. Magnanti,et al.  Working Paper Alfred P. Sloan School of Management "models for Planning Capacity Expansion in Local Access Telecommunication Networks" "models for Planning Capacity Expansion in Local Access Telecommunication Networks" Models for Planning Capacity Expansion in Local Access Telecommunication Networks , 2008 .

[55]  Rüdiger Schultz,et al.  Probability Objectives in Stochastic Programs with Recourse , 2001, System Modelling and Optimization.

[56]  John R. Birge,et al.  Introduction to Stochastic Programming , 1997 .

[57]  Maarten Hendrikus van der Vlerk.  Stochastic programming with integer recourse , 1995 .

[58]  Leen Stougie.  Design and analysis of algorithms for stochastic integer programming , 1987 .

[59]  R. P. Harvey.  The decomposition principle for linear programs , 1964 .

[60]  Oktay Günlük,et al.  Mixing mixed-integer inequalities , 2001, Math. Program..

[61]  H. L. Le Roy,et al.  Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability; Vol. IV , 1969 .

[62]  Dudley,et al.  Real Analysis and Probability: Measurability: Borel Isomorphism and Analytic Sets , 2002 .

[63]  Christian Schulz,et al.  Online Scheduling of Multiproduct Batch Plants under Uncertainty , 2001 .

[64]  Informationstechnik Berlin,et al.  Dual Decomposition in Stochastic Integer Programming , 1996 .

[65]  Morten Riis,et al.  Applying the minimax criterion in stochastic recourse programs , 2005, Eur. J. Oper. Res..

[66]  Thomas L. Magnanti,et al.  The convex hull of two core capacitated network design problems , 1993, Math. Program..

[67]  Wlodzimierz Ogryczak,et al.  Dual Stochastic Dominance and Related Mean-Risk Models , 2002, SIAM J. Optim..

[68]  William T. Ziemba.  Computational Algorithms for Convex Stochastic Programs with Simple Recourse , 1970, Oper. Res..

[69]  A. Ruszczynski,et al.  Dual stochastic dominance and quantile risk measures , 2002 .

[70]  Raymond Hemmecke,et al.  Decomposition of test sets in stochastic integer programming , 2003, Math. Program..

[71]  Peter Kall.  Solution methods in stochastic programming , 1993, System Modelling and Optimization.

[72]  K. Kiwiel.  Methods of Descent for Nondifferentiable Optimization , 1985 .

[73]  V Marianov,et al.  Survivable capacitated network design problem: new formulation and Lagrangean relaxation , 2000, J. Oper. Res. Soc..

[74]  Jim Freeman.  Probability Metrics and the Stability of Stochastic Models , 1991 .

[75]  Alan F. Karr,et al.  Extreme Points of Certain Sets of Probability Measures, with Applications , 1983, Math. Oper. Res..

[76]  M. Laguna,et al.  Applying Robust Optimization to Capacity Expansion of One Location in Telecommunications with Demand Uncertainty , 1998 .

[77]  Andrzej Ruszczynski,et al.  On Optimal Allocation of Indivisibles Under Uncertainty , 1998, Oper. Res..

[78]  Svetlozar T. Rachev,et al.  Quantitative Stability in Stochastic Programming: The Method of Probability Metrics , 2002, Math. Oper. Res..

[79]  Morten Riis,et al.  Multiperiod capacity expansion of a telecommunications connection with uncertain demand , 2004, Comput. Oper. Res..

[80]  Iraj Saniee.  An Efficient Algorithm for the Multiperiod Capacity Expansion of One Location in Telecommunications , 1995, Oper. Res..

[81]  Hans-Jürgen Zimmermann,et al.  On stochastic integer programming , 1975, Z. Oper. Research.

[82]  Philippe Artzner,et al.  Coherent Measures of Risk , 1999 .

[83]  Stein W. Wallace,et al.  Decision Making Under Uncertainty: Is Sensitivity Analysis of Any Use? , 2000, Oper. Res..

[84]  Thomas L. Magnanti,et al.  A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning , 1995, Oper. Res..

[85]  Thomas L. Magnanti,et al.  A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design , 1989, Oper. Res..

[86]  Gilbert Laporte,et al.  A Priori Optimization of the Probabilistic Traveling Salesman Problem , 1994, Oper. Res..

[87]  Jack E. Graver,et al.  On the foundations of linear and integer linear programming I , 1975, Math. Program..

[88]  Sanjay V. Rajopadhye,et al.  Unbounded knapsack problem: Dynamic programming revisited , 2000, Eur. J. Oper. Res..

[89]  Rüdiger Schultz.  Continuity Properties of Expectation Functions in Stochastic Integer Programming , 1993, Math. Oper. Res..

[90]  George B Dantzig,et al.  ON THE SOLUTION OF TWO-STAGE LINEAR PROGRAMS UNDER UNCERTAINTY. NOTES ON LINEAR PROGRAMMING AND EXTENSIONS. PART 55 , 1961 .

[91]  Julia L. Higle,et al.  Statistical approximations forstochastic linear programming problems , 1999, Ann. Oper. Res..

[92]  J. Dupacová.  Stability and sensitivity-analysis for stochastic programming , 1991 .

[93]  Leen Stougie,et al.  An algorithm for the construction of convex hulls in simple integer recourse programming , 1996, Ann. Oper. Res..

[94]  B. Bank,et al.  Parametric Integer Optimization , 1988 .

[95]  Amitava Mukherjee,et al.  A Simple Heuristic for Assignment of Cells to Switches in a PCS Network , 2000, Wirel. Pers. Commun..

[96]  Samer Takriti,et al.  Managing Short-Term Electricity Contracts Under Uncertainty : A Minimax Approach , 2002 .

[97]  R. Wets,et al.  L-SHAPED LINEAR PROGRAMS WITH APPLICATIONS TO OPTIMAL CONTROL AND STOCHASTIC PROGRAMMING. , 1969 .

[98]  R. Schultz,et al.  Multistage Stochastic Integer Programs: An Introduction , 2001 .

[99]  R. Tyrrell Rockafellar,et al.  Scenarios and Policy Aggregation in Optimization Under Uncertainty , 1991, Math. Oper. Res..

[100]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..

[101]  J. Birge,et al.  A multicut algorithm for two-stage stochastic linear programs , 1988 .

[102]  Julia L. Higle,et al.  Finite master programs in regularized stochastic decomposition , 1994, Math. Program..

[103]  Gilbert Laporte,et al.  The Vehicle Routing Problem with Stochastic Travel Times , 1992, Transp. Sci..

[104]  J. Dupacová.  Stochastic programming with incomplete information:a surrey of results on postoptimization and sensitivity analysis , 1987 .

[105]  Bezalel Gavish,et al.  Lower Bounding Procedures for Multiperiod Telecommunications Network Expansion Problems , 1995, Oper. Res..

[106]  Geir Dahl,et al.  A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems , 1998, INFORMS J. Comput..

[107]  A. Charnes,et al.  Chance-Constrained Programming , 1959 .

[108]  Nikolaos V. Sahinidis,et al.  A finite branch-and-bound algorithm for two-stage stochastic integer programs , 2004, Math. Program..

[109]  M. Stoer.  Design of Survivable Networks , 1993 .

[110]  B. Sengupta,et al.  Assignment of cells to switches in PCS networks , 1995, TNET.

[111]  Rüdiger Schultz,et al.  Some Aspects of Stability in Stochastic Programming , 2000, Ann. Oper. Res..

[112]  B. Bank,et al.  Non-Linear Parametric Optimization , 1983 .

[113]  Marc Despontin,et al.  Multiple Criteria Optimization: Theory, Computation, and Application, Ralph E. Steuer (Ed.). Wiley, Palo Alto, CA (1986) , 1987 .

[114]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[115]  Maarten H. van der Vlerk,et al.  On the expected value function of a simple integer recourse problem with random technology matrix , 1994 .

[116]  E. A. Medova,et al.  Chance-constrained stochastic programming forintegrated services network management , 1998, Ann. Oper. Res..

[117]  Maarten H. van der Vlerk,et al.  Stochastic programming with simple integer recourse , 1993, Math. Program..

[118]  José H. Dulá,et al.  Bounding separable recourse functions with limited distribution information , 1991, Ann. Oper. Res..

[119]  Bezalel Gavish,et al.  Telecommunications network topological design and capacity expansion: Formulations and algorithms , 1993, Telecommun. Syst..

[120]  J. Dupacová.  The minimax approach to stochastic programming and an illustrative application , 1987 .

[121]  Morten Riis,et al.  A bicriteria stochastic programming model for capacity expansion in telecommunications , 2002, Math. Methods Oper. Res..

[122]  Rüdiger Schultz,et al.  Applying the Minimum Risk Criterion in Stochastic Recourse Programs , 2003, Comput. Optim. Appl..

[123]  Werner Römisch,et al.  Stability analysis for stochastic programs , 1991, Ann. Oper. Res..

[124]  Thomas L. Magnanti,et al.  Modeling and Solving the Two-Facility Capacitated Network Loading Problem , 1995, Oper. Res..

[125]  E. Beale.  ON MINIMIZING A CONVEX FUNCTION SUBJECT TO LINEAR INEQUALITIES , 1955 .

[126]  Leen Stougie,et al.  Convex simple integer recourse models , 1997 .

[127]  Rüdiger Schultz.  Rates of Convergence in Stochastic Programs with Complete Integer Recourse , 1996, SIAM J. Optim..

[128]  G. Dantzig.  23. A Decomposition Principle for Linear Programs , 1963 .

[129]  Maarten H. van der Vlerk,et al.  Stochastic integer programming:General models and algorithms , 1999, Ann. Oper. Res..

[130]  Leen Stougie,et al.  Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis , 1995, Math. Program..

[131]  Julia L. Higle,et al.  Statistical verification of optimality conditions for stochastic programs with recourse , 1991, Ann. Oper. Res..

[132]  Y. Ermoliev,et al.  Stochastic Optimization Problems with Partially Known Distribution Functions , 1982 .

[133]  Julia L. Higle,et al.  Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse , 1991, Math. Oper. Res..

[134]  Oktay Günlük,et al.  Minimum cost capacity installation for multicommodity network flows , 1998, Math. Program..

[135]  Richard D. Wollmer,et al.  Two stage linear programming under uncertainty with 0–1 integer first stage variables , 1980, Math. Program..

[136]  Stephen M. Robinson,et al.  Local epi-continuity and local optimization , 1987, Math. Program..

[137]  M. Minoux.  Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements* , 1981 .

[138]  J. Kemperman.  The General Moment Problem, A Geometric Approach , 1968 .

[139]  Peter Kall,et al.  On approximations and stability in stochastic programming , 1987 .

[140]  S. Challinor.  An Introduction to IP Networks , 2000 .

[141]  R. Wets,et al.  STOCHASTIC PROGRAMS WITH RECOURSE , 1967 .

[142]  Rüdiger Schultz,et al.  Risk Aversion via Excess Probabilities in Stochastic Programs with Mixed-Integer Recourse , 2003, SIAM J. Optim..

[143]  John M. Mulvey,et al.  A New Scenario Decomposition Method for Large-Scale Stochastic Optimization , 1995, Oper. Res..

[144]  M. Pereira,et al.  Stochastic Optimization of a Multireservoir Hydroelectric System: A Decomposition Approach , 1985 .

[145]  Werner Römisch,et al.  Stability of Solutions for Stochastic Programs with Complete Recourse , 1993, Math. Oper. Res..

[146]  John R. Birge,et al.  A stochastic model for the unit commitment problem , 1996 .

[147]  Maarten H. van der Vlerk,et al.  Convex approximations for complete integer recourse models , 2004, Math. Program..

[148]  Wlodzimierz Ogryczak,et al.  From stochastic dominance to mean-risk models: Semideviations as risk measures , 1999, Eur. J. Oper. Res..

[149]  Jinde Wang,et al.  Distribution sensitivity analysis for stochastic programs with complete recourse , 1985, Math. Program..

[150]  M. Breton,et al.  A scenario aggregation algorithm for the solution of stochastic dynamic minimax problems , 1995 .

[151]  Oktay Günlük,et al.  Capacitated Network Design - Polyhedral Structure and Computation , 1996, INFORMS J. Comput..