The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks
From MaRDI portal
Publication:518934
DOI10.1007/s10732-014-9241-6zbMath1358.90163OpenAlexW2059840760MaRDI QIDQ518934
Jacques Carlier, Dritan Nace, Oana Stan, Renaud Sirdey
Publication date: 4 April 2017
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-014-9241-6
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Stochastic graph partitioning: quadratic versus SOCP formulations, A model‐and data‐driven predictive control approach for tracking of stochastic nonlinear systems using Gaussian processes, The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks
- Knapsack problem with probability constraints
- A survey on metaheuristics for stochastic combinatorial optimization
- Sample average approximation method for chance constrained programming: Theory and applications
- Cutting plane algorithms for solving a stochastic edge-partition problem
- Some simplified NP-complete graph problems
- Cliques and clustering: A combinatorial approach
- The node capacitated graph partitioning problem: A computational study
- Robust solutions of uncertain linear programs
- Min-cut clustering
- On an approximation measure founded on the links between optimization and polynomial approximation theory
- Graph partitioning using linear and semidefinite programming
- Uncertain convex programs: randomized solutions and confidence levels
- A new method, the fusion fission, for the relaxed \(k\)-way graph partitioning problem, and comparisons with some multilevel algorithms
- Beam search heuristic to solve stochastic integer problems under probabilistic constraints
- Robust Optimization of Graph Partitioning and Critical Node Detection in Analyzing Networks
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- The Price of Robustness
- An Efficient Heuristic Procedure for Partitioning Graphs
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Randomized algorithms for robust controller synthesis using statistical learning theory
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- On the Two-Stage Stochastic Graph Partitioning Problem
- The Scenario Approach to Robust Control Design
- Concavity and efficient points of discrete distributions in probabilistic programming.
