Cutting plane algorithms for solving a stochastic edge-partition problem

DOI10.1016/J.DISOPT.2009.05.004MaRDI QIDQ1040087zbMATH OpenOpenAlexFDO

Authors Z. Caner Taşkın, J. Cole Smith, Andrew J. Schaefer, S. 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

zbMATH Keywords

stochastic optimizationinteger programmingconstraint programmingedge-partition

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic programming (90C15) Integer programming (90C10)

Recommendations

• On the two-stage stochastic graph partitioning problem
• On the solution of a graph partitioning problem under capacity constraints
• A branch-and-cut algorithm for solving an intraring synchronous optical network design problem
• scientific article; zbMATH DE number 3991298
• Stochastic survivable network design problems: theory and practice

Cites work

• scientific article; zbMATH DE number 2084694 (Why is no real title available?)
• A Sample Approximation Approach for Optimization with Probabilistic Constraints
• A branch-and-cut algorithm for solving an intraring synchronous optical network design problem
• A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse
• A stochastic integer programming approach to solving a synchronous optical network ring design problem
• Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network.
• Algorithms for hybrid MILP/CP models for a class of optimization problems
• Detecting infeasibility and generating cuts for mixed integer programming using constraint programming
• Dual decomposition in stochastic integer programming
• Enhanced model representations for an intra-ring synchronous optical network design problem allowing demand splitting
• Handbook of constraint programming.
• Improving Discrete Model Representations via Symmetry Considerations
• Logic-based Benders decomposition
• Optimal placement of add/drop multiplexers: Heuristic and exact algorithms
• Planning and Scheduling by Logic-Based Benders Decomposition
• Scenario approximations of chance constraints
• Symmetry and Search in a Network Design Problem
• The SONET edge‐partition problem
• The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• Uncertain convex programs: randomized solutions and confidence levels

Cited in

(13)

• scientific article; zbMATH DE number 3856823 (Why is no real title available?)
• Optimizing system resilience: a facility protection model with recovery time
• Constraint programming and operations research
• Planning personnel retraining: column generation heuristics
• Simplex partitioning via exponential clocks and the multiway cut problem
• Multiple Cuts in Separating Plane Algorithms
• Integer programming models and algorithms for the graph decontamination problem with mobile agents
• Scheduling personnel retraining: column generation heuristics
• An exact approach for the r-interdiction median problem with fortification
• The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks
• Integer programming formulations for three sequential discrete competitive location problems with foresight
• Logic-based Benders decomposition for large-scale optimization
• On the two-stage stochastic graph partitioning problem

This page was built for publication: Cutting plane algorithms for solving a stochastic edge-partition problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1040087)