On the two-stage stochastic graph partitioning problem

DOI10.1007/978-3-642-22616-8_39MaRDI QIDQ5199175zbMATH OpenOpenAlexWikidataFDO

Authors Neng Fan, Qipeng P. Zheng, Panos M. Pardalos

Publication date 12 August 2011

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22616-8_39

zbMATH Keywords

stochastic optimizationinteger programminggraph partitioning

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Stochastic programming (90C15) Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Cutting plane algorithms for solving a stochastic edge-partition problem
• Stochastic graph partitioning: quadratic versus SOCP formulations
• On the solution of a graph partitioning problem under capacity constraints
• Solving two-stage stochastic Steiner tree problems by two-stage branch-and-cut
• Robust optimization of graph partitioning involving interval uncertainty

Cited in

(9)

• Simultaneous estimation of thin film thickness and optical properties using two-stage optimization
• Stochastic analysis of partitioning algorithms for matching problems
• Balanced graph partitioning based on mixed 0-1 linear programming and iteration vertex relocation algorithm
• Cutting plane algorithms for solving a stochastic edge-partition problem
• Robust optimization of graph partitioning involving interval uncertainty
• 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
• Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms
• Exact vertex migration model of graph partitioning based on mixed 0-1 linear programming and iteration algorithm

This page was built for publication: On the two-stage stochastic graph partitioning problem

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