Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization
From MaRDI portal
Publication:4609983
zbMath1390.90405arXiv1504.00076MaRDI QIDQ4609983
Edgardo Roldán-Pensado, Deborah Oliveros, Jesús A. De Loera, Reuben N. La Haye
Publication date: 27 March 2018
Full work available at URL: https://arxiv.org/abs/1504.00076
combinatorial convexitychance-constrained optimizationHelly-type theoremsconvexity spacesconvex mixed-integer optimizationoptimization with restricted variable valuesrandomized sampling algorithmsS-optimization
Mixed integer programming (90C11) Stochastic programming (90C15) Programming in abstract spaces (90C48)
Related Items
Quantitative Tverberg theorems over lattices and other discrete sets, Helly numbers of algebraic subsets of \(\mathbb{R}^{d}\) and an extension of Doignon's theorem, Random sampling with removal, Centerpoints: A Link between Optimization and Convex Geometry, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mixed integer linear programming formulations for probabilistic constraints
- Violator spaces: Structure and algorithms
- Sample average approximation method for chance constrained programming: Theory and applications
- A Tverberg-type generalization of the Helly number of a convexity space
- Partition numbers for trees and ordered sets
- Helly-type theorems and generalized linear programming
- A probabilistic quality of service constraint for a location model of switches in ATM communications networks
- Helly numbers of algebraic subsets of \(\mathbb{R}^{d}\) and an extension of Doignon's theorem
- Optimality certificates for convex minimization and Helly numbers
- Uncertain convex programs: randomized solutions and confidence levels
- Designing robust emergency medical service via stochastic programming
- Bounds for probabilistic integer programming problems
- Flat transversals to flats and convex sets of a fixed dimension
- Axiomatic convexity theory and relationships between the Carathéodory, Helly, and Radon numbers
- Convexity in cristallographical lattices
- Transversal numbers over subsets of linear spaces
- The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- An observation on the structure of production sets with indivisibilities
- Probabilistic Formulation of the Emergency Service Location Problem
- A Theorem Concerning the Integer Lattice
- Las Vegas algorithms for linear and integer programming when the dimension is small
- A combinatorial bound for linear programming and related problems
- The Scenario Approach to Robust Control Design
- Integer Programming over a Finite Additive Group
- Centerpoints: A Link between Optimization and Convex Geometry
- Algorithms - ESA 2003
