Solving chance-constrained combinatorial problems to optimality
type: Item
instance of: scholarly article
title: Solving chance-constrained combinatorial problems to optimality
zbMATH Open document ID: 1213.90185
author: Olivier Klopfenstein
published in: Computational Optimization and Applications
publication date: 2010-04-28T00:00:00Z
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 5702498
zbMATH Keywords: chance-constrained programming
zbMATH Keywords: integer linear programming
MaRDI profile type: Publication
full work available at URL: s10589-008-9177-6
OpenAlex ID: W1992464885
cites work: Robust solutions of linear programming problems contaminated with uncertain data
cites work: A branch and bound method for stochastic integer problems under probabilistic constraints
cites work: The Price of Robustness
cites work: A survey on metaheuristics for stochastic combinatorial optimization
cites work: Introduction to Stochastic Programming
cites work: On the distribution of the sum of \(n\) non-identically distributed uniform random variables
cites work: Uncertain convex programs: randomized solutions and confidence levels
cites work: On distributionally robust chance-constrained linear programs
cites work: Chance-constrained programming
cites work: Ambiguous chance constrained problems and robust optimization
cites work: Q4393471
cites work: Stochastic integer programming: general models and algorithms
cites work: Chance-Constrained Programming with 0-1 or Bounded Continuous Decision Variables
cites work: Stochastic linear programming. Models, theory, and computation
cites work: A robust approach to the chance-constrained knapsack problem
cites work: Q5201292
cites work: Convex Approximations of Chance Constrained Programs
cites work: Q4838490
cites work: Q4729614
cites work: Experimental study on the efficiency and accuracy of a chance-constrained programming algorithm
cites work: An algebraic geometry algorithm for scheduling in presence of setups and correlated demands
cites work: A Cutting Plane Approach for Chance Constrained Linear Programs
DOI: 10.1007/S10589-008-9177-6
Recommended article: Tractable algorithms for chance-constrained combinatorial problems
Recommended article: Q3059326
Recommended article: Approximations for chance-constrained programming problems
Recommended article: Q4035171
Recommended article: Computational combinatorial optimization. Optimal of probably near-optimal solutions
Recommended article: Chance-constrained programming
Recommended article: Extremal Probability Bounds in Combinatorial Optimization
Recommended article: Q3707402
description: scientific article; zbMATH DE number 5702498