A branch and bound method for stochastic integer problems under probabilistic constraints
From MaRDI portal
Publication:4709729
DOI10.1080/1055678021000033937zbMath1064.90030OpenAlexW2092425721MaRDI QIDQ4709729
Ruszczyński, Andrzej, Patrizia Beraldi
Publication date: 2002
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/1055678021000033937
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Stochastic programming (90C15)
Related Items
On the mixing set with a knapsack constraint, Decomposition algorithms for two-stage chance-constrained programs, The mixed capacitated general routing problem under uncertainty, Data-driven chance constrained stochastic program, A joint chance-constrained programming approach for the single-item capacitated lot-sizing problem with stochastic demand, MIP reformulations of the probabilistic set covering problem, An integer programming approach for linear programs with probabilistic constraints, Relaxations and approximations of chance constraints under finite distributions, Approximation of probabilistic constraints in stochastic programming problems with a probability measure kernel, An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems, Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs, Proportional and maxmin fairness for the sensor location problem with chance constraints, Easy distributions for combinatorial optimization problems with probabilistic constraints, A polyhedral study on chance constrained program with random right-hand side, New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem, A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging, Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness, A solution algorithm for chance-constrained problems with integer second-stage recourse decisions, Single-item dynamic lot-sizing problems: an updated survey, On mixing sets arising in chance-constrained programming, Capital rationing problems under uncertainty and risk, Uniform quasi-concavity in probabilistic constrained stochastic programming, Mixed integer linear programming formulations for probabilistic constraints, A polyhedral study of the static probabilistic lot-sizing problem, An exact approach for solving integer problems under probabilistic constraints with random technology matrix, Bicriteria Approximation of Chance-Constrained Covering Problems, Genetic algorithm based technique for solving chance constrained problems, A polynomial approximation-based approach for chance-constrained optimization, A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality, Stochastic lot-sizing with backlogging: computational complexity analysis, Solving chance-constrained combinatorial problems to optimality, Beam search heuristic to solve stochastic integer problems under probabilistic constraints, A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs, Variable neighborhood search for a two-stage stochastic programming problem with a quantile criterion, Tractable algorithms for chance-constrained combinatorial problems, The risk-averse traveling repairman problem with profits, Chance-constrained sets approximation: a probabilistic scaling approach, Designing robust emergency medical service via stochastic programming, An Adaptive Partition-Based Approach for Solving Two-Stage Stochastic Programs with Fixed Recourse, A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
Uses Software
Cites Work
- Unnamed Item
- Lot-size models with backlogging: Strong reformulations and cutting planes
- Relaxations for probabilistically constrained programs with discrete random variables
- Dynamic Version of the Economic Lot Size Model
- The Theory of Search: Optimum Distribution of Search Effort
- Uncapacitated lot-sizing: The convex hull of solutions
- The Probabilistic Set-Covering Problem
- Solving Large-Scale Zero-One Linear Programming Problems
- Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition
- Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- Stochastic programming in production planning: a case with none-simple recourse
- Contributions to the theory of stochastic programming
- Chance Constrained Programming with Joint Constraints
