The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks
From MaRDI portal
(Redirected from Publication:518934)
Recommendations
- Exploiting structure of chance constrained programs via submodularity
- Partial sample average approximation method for chance constrained problems
- Global optimization of robust chance constrained problems
- Solving chance-constrained combinatorial problems to optimality
- Sample average approximation method for chance constrained programming: Theory and applications
Cites work
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A new method, the fusion fission, for the relaxed \(k\)-way graph partitioning problem, and comparisons with some multilevel algorithms
- A survey on metaheuristics for stochastic combinatorial optimization
- An Efficient Heuristic Procedure for Partitioning Graphs
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- Beam search heuristic to solve stochastic integer problems under probabilistic constraints
- Cliques and clustering: A combinatorial approach
- Concavity and efficient points of discrete distributions in probabilistic programming.
- Cutting plane algorithms for solving a stochastic edge-partition problem
- Graph partitioning using linear and semidefinite programming
- scientific article; zbMATH DE number 5761786 (Why is no real title available?)
- scientific article; zbMATH DE number 708500 (Why is no real title available?)
- scientific article; zbMATH DE number 1875431 (Why is no real title available?)
- scientific article; zbMATH DE number 772850 (Why is no real title available?)
- Knapsack problem with probability constraints
- Min-cut clustering
- On an approximation measure founded on the links between optimization and polynomial approximation theory
- On the two-stage stochastic graph partitioning problem
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Randomized algorithms for robust controller synthesis using statistical learning theory
- Robust optimization of graph partitioning and critical node detection in analyzing networks
- Robust solutions of uncertain linear programs
- Sample average approximation method for chance constrained programming: Theory and applications
- Some simplified NP-complete graph problems
- The node capacitated graph partitioning problem: A computational study
- The Price of Robustness
- The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks
- The Scenario Approach to Robust Control Design
- Uncertain convex programs: randomized solutions and confidence levels
Cited in
(6)- Global optimization of robust chance constrained problems
- Exploiting structure of chance constrained programs via submodularity
- Stochastic graph partitioning: quadratic versus SOCP formulations
- The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks
- A model‐and data‐driven predictive control approach for tracking of stochastic nonlinear systems using Gaussian processes
- Vehicle tracking with obstacle avoidance under uncertainty using Gaussian processes and backoffs
This page was built for publication: The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q518934)
