@inproceedings{a0d6e1fb055b445583870709f38efe81,
title = "On the two-stage stochastic graph partitioning problem",
abstract = "In this paper we introduce the two-stage stochastic graph partitioning problem and present the stochastic mixed integer programming formulation for this problem with finite explicit scenarios. For solving this problem, we present an equivalent integer linear programming formulation where some binary variables are relaxed to continuous ones. Additionally, for some specific graphs, we present a more simplified linear programming formulation. All formulations are tested on randomly generated graphs with different densities and different numbers of scenarios.",
keywords = "Graph Partitioning, Integer Programming, Stochastic Optimization",
author = "Neng Fan and Zheng, {Qipeng P.} and Pardalos, {Panos M.}",
year = "2011",
doi = "10.1007/978-3-642-22616-8_39",
language = "English (US)",
isbn = "9783642226151",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "500--509",
booktitle = "Combinatorial Optimization and Applications - 5th International Conference, COCOA 2011, Proceedings",
note = "5th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2011 ; Conference date: 04-08-2011 Through 06-08-2011",
}