An exact approach for solving integer problems under probabilistic constraints with random technology matrix
From MaRDI portal
Publication:1958623
DOI10.1007/s10479-009-0670-9zbMath1195.90066OpenAlexW2018100380MaRDI QIDQ1958623
Maria Elena Bruni, Patrizia Beraldi
Publication date: 4 October 2010
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-009-0670-9
Related Items (22)
Solving joint chance constrained problems using regularization and Benders' decomposition ⋮ The mixed capacitated general routing problem under uncertainty ⋮ Nonlinear chance constrained problems: optimality conditions, regularization and solvers ⋮ A probabilistic model applied to emergency service vehicle location ⋮ Multi-objective probabilistically constrained programs with variable risk: models for multi-portfolio financial optimization ⋮ Chance-Constrained Binary Packing Problems ⋮ Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks ⋮ Easy distributions for combinatorial optimization problems with probabilistic constraints ⋮ A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support ⋮ Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness ⋮ Chance-constrained set covering with Wasserstein ambiguity ⋮ Joint chance-constrained multi-objective multi-commodity minimum cost network flow problem with copula theory ⋮ Capital rationing problems under uncertainty and risk ⋮ Stochastic binary problems with simple penalties for capacity constraints violations ⋮ An exact approach for solving integer problems under probabilistic constraints with random technology matrix ⋮ Probabilistic Partial Set Covering with an Oracle for Chance Constraints ⋮ Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios ⋮ Flow-based formulations for operational fixed interval scheduling problems with random delays ⋮ Branch-and-cut approaches for chance-constrained formulations of reliable network design problems ⋮ Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities ⋮ Special issue on: Optimization methods for decision making: advances and applications ⋮ The risk-averse traveling repairman problem with profits
Uses Software
Cites Work
- Unnamed Item
- Relaxations for probabilistically constrained programs with discrete random variables
- Stochastic vehicle routing
- Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
- Strategic facility location: A review
- Designing robust emergency medical service via stochastic programming
- Bounds for probabilistic integer programming problems
- An exact approach for solving integer problems under probabilistic constraints with random technology matrix
- A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs
- Chance-Constrained Programming
- The Probabilistic Set-Covering Problem
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- A branch and bound method for stochastic integer problems under probabilistic constraints
- Contributions to the theory of stochastic programming
- Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
- Concavity and efficient points of discrete distributions in probabilistic programming.
This page was built for publication: An exact approach for solving integer problems under probabilistic constraints with random technology matrix
