On the Two-Stage Stochastic Graph Partitioning Problem

DOI10.1007/978-3-642-22616-8_39zbMath1342.90214OpenAlexW121377402WikidataQ57734142 ScholiaQ57734142MaRDI QIDQ5199175

Neng Fan, Qipeng Phil 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) Integer programming (90C10) Stochastic programming (90C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Stochastic graph partitioning: quadratic versus SOCP formulations ⋮ Simultaneous estimation of thin film thickness and optical properties using two-stage optimization ⋮ Balanced graph partitioning based on mixed 0-1 linear programming and iteration vertex relocation algorithm ⋮ The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks

This page was built for publication: On the Two-Stage Stochastic Graph Partitioning Problem