Cutting plane algorithms for solving a stochastic edge-partition problem
From MaRDI portal
Publication:1040087
DOI10.1016/j.disopt.2009.05.004zbMath1179.90322OpenAlexW2000005960MaRDI QIDQ1040087
Andrew J. Schaefer, J. Cole Smith, Z. Caner Taşkın, Shabbir Ahmed
Publication date: 23 November 2009
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2009.05.004
Programming involving graphs or networks (90C35) Integer programming (90C10) Stochastic programming (90C15)
Related Items
Constraint programming and operations research ⋮ Planning personnel retraining: column generation heuristics ⋮ Integer programming models and algorithms for the graph decontamination problem with mobile agents ⋮ Integer programming formulations for three sequential discrete competitive location problems with foresight ⋮ Optimizing system resilience: a facility protection model with recovery time ⋮ Logic-Based Benders Decomposition for Large-Scale Optimization ⋮ The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks ⋮ Scheduling Personnel Retraining: Column Generation Heuristics ⋮ An exact approach for the r-interdiction median problem with fortification
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Dual decomposition in stochastic integer programming
- Logic-based Benders decomposition
- Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network.
- Uncertain convex programs: randomized solutions and confidence levels
- Detecting infeasibility and generating cuts for mixed integer programming using constraint programming
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms
- Enhanced Model Representations for an Intra-Ring Synchronous Optical Network Design Problem Allowing Demand Splitting
- Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
- Improving Discrete Model Representations via Symmetry Considerations
- Planning and Scheduling by Logic-Based Benders Decomposition
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- A branch-and-cut algorithm for solving an intraring synchronous optical network design problem
- The SONET edge‐partition problem
- A stochastic integer programming approach to solving a synchronous optical network ring design problem
- Symmetry and Search in a Network Design Problem