Solving chance-constrained combinatorial problems to optimality

DOI10.1007/s10589-008-9177-6zbMath1213.90185OpenAlexW1992464885MaRDI QIDQ967213

Olivier Klopfenstein

Publication date: 28 April 2010

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-008-9177-6

zbMATH Keywords

integer linear programmingchance-constrained programming

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Stochastic programming (90C15)

Related Items

The mixed capacitated general routing problem under uncertainty ⋮ Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks ⋮ Easy distributions for combinatorial optimization problems with probabilistic constraints ⋮ Design of survivable wireless backhaul networks with reliability considerations ⋮ Stochastic binary problems with simple penalties for capacity constraints violations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Experimental study on the efficiency and accuracy of a chance-constrained programming algorithm
• A robust approach to the chance-constrained knapsack problem
• A survey on metaheuristics for stochastic combinatorial optimization
• Stochastic integer programming: general models and algorithms
• Robust solutions of linear programming problems contaminated with uncertain data
• Uncertain convex programs: randomized solutions and confidence levels
• Stochastic linear programming. Models, theory, and computation
• On the distribution of the sum of \(n\) non-identically distributed uniform random variables
• An algebraic geometry algorithm for scheduling in presence of setups and correlated demands
• On distributionally robust chance-constrained linear programs
• Ambiguous chance constrained problems and robust optimization
• Chance-Constrained Programming
• The Price of Robustness
• A Cutting Plane Approach for Chance Constrained Linear Programs
• Introduction to Stochastic Programming
• A branch and bound method for stochastic integer problems under probabilistic constraints
• Convex Approximations of Chance Constrained Programs
• Chance-Constrained Programming with 0-1 or Bounded Continuous Decision Variables