Solving chance-constrained combinatorial problems to optimality
From MaRDI portal
Recommendations
- Tractable algorithms for chance-constrained combinatorial problems
- Probabilistic combinatorial optimization
- Approximations for chance-constrained programming problems
- scientific article; zbMATH DE number 176071
- Computational combinatorial optimization. Optimal of probably near-optimal solutions
- Chance-constrained programming
- Extremal probability bounds in combinatorial optimization
- scientific article; zbMATH DE number 3936510
Cites work
- scientific article; zbMATH DE number 1161555 (Why is no real title available?)
- scientific article; zbMATH DE number 4114379 (Why is no real title available?)
- scientific article; zbMATH DE number 772850 (Why is no real title available?)
- A Cutting Plane Approach for Chance Constrained Linear Programs
- A branch and bound method for stochastic integer problems under probabilistic constraints
- A robust approach to the chance-constrained knapsack problem
- A survey on metaheuristics for stochastic combinatorial optimization
- Ambiguous chance constrained problems and robust optimization
- An algebraic geometry algorithm for scheduling in presence of setups and correlated demands
- Chance-Constrained Programming with 0-1 or Bounded Continuous Decision Variables
- Chance-constrained programming
- Convex Approximations of Chance Constrained Programs
- Experimental study on the efficiency and accuracy of a chance-constrained programming algorithm
- Introduction to Stochastic Programming
- On distributionally robust chance-constrained linear programs
- On the distribution of the sum of \(n\) non-identically distributed uniform random variables
- Robust solutions of linear programming problems contaminated with uncertain data
- Scenario approximations of chance constraints
- Stochastic integer programming: general models and algorithms
- Stochastic linear programming. Models, theory, and computation
- The Price of Robustness
- Uncertain convex programs: randomized solutions and confidence levels
Cited in
(19)- A solution algorithm for chance-constrained problems with integer second-stage recourse decisions
- The mixed capacitated general routing problem under uncertainty
- Modeling uncertainties with chance constraints
- Design of survivable wireless backhaul networks with reliability considerations
- Chance-constrained optimization of reliable fixed broadband wireless networks
- Possibilistic bottleneck combinatorial optimization problems with ill-known weights
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- An integer programming and decomposition approach to general chance-constrained mathematical programs
- IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation
- On the quantile cut closure of chance-constrained problems
- Easy distributions for combinatorial optimization problems with probabilistic constraints
- Using integer programming for balancing return and risk in problems with individual chance constraints
- Solving linear unconstrained problems of combinatorial optimization on arrangements under stochastic uncertainty
- The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks
- Stochastic binary problems with simple penalties for capacity constraints violations
- Tractable algorithms for chance-constrained combinatorial problems
- Application of the polyblock method to special integer chance constrained problem
- Combinatorial optimization problems with normal random costs
- An exact algorithm for linear integer programming problems with distributionally robust chance constraints
This page was built for publication: Solving chance-constrained combinatorial problems to optimality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q967213)
