Easy distributions for combinatorial optimization problems with probabilistic constraints
From MaRDI portal
Publication:614036
DOI10.1016/j.orl.2010.09.005zbMath1202.90224OpenAlexW1970608397MaRDI QIDQ614036
Publication date: 23 December 2010
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2010.09.005
Related Items (2)
The mixed capacitated general routing problem under uncertainty ⋮ Convexity and Solutions of Stochastic Multidimensional 0-1 Knapsack Problems with Probabilistic Constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Telecommunication network capacity design for uncertain demand
- MIP reformulations of the probabilistic set covering problem
- Solving chance-constrained combinatorial problems to optimality
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- Convexity of chance constraints with independent random variables
- Sample average approximation method for chance constrained programming: Theory and applications
- Bounds for probabilistic integer programming problems
- Review of nonlinear mixed-integer and disjunctive programming techniques
- An exact approach for solving integer problems under probabilistic constraints with random technology matrix
- On distributionally robust chance-constrained linear programs
- A probabilistic model applied to emergency service vehicle location
- Beam search heuristic to solve stochastic integer problems under probabilistic constraints
- Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- An Efficient Trajectory Method for Probabilistic Production-Inventory-Distribution Problems
- Provisioning virtual private networks under traffic uncertainty
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- The Probabilistic Set-Covering Problem
- Lectures on Stochastic Programming
- An Integer Programming Approach to the Bandwidth Packing Problem
- A branch and bound method for stochastic integer problems under probabilistic constraints
- Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
- A Stochastic Programming Model
This page was built for publication: Easy distributions for combinatorial optimization problems with probabilistic constraints
