On the two-stage stochastic graph partitioning problem

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

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.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages500-509
Number of pages10
Volume6831 LNCS
DOIs
StatePublished - 2011
Externally publishedYes
Event5th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2011 - Zhangjiajie, China
Duration: Aug 4 2011Aug 6 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6831 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other5th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2011
CountryChina
CityZhangjiajie
Period8/4/118/6/11

Fingerprint

Graph Partitioning
Linear programming
Formulation
Integer programming
Stochastic Integer Programming
Scenarios
Binary Variables
Integer Linear Programming
Mixed Integer Programming
Graph in graph theory

Keywords

  • Graph Partitioning
  • Integer Programming
  • Stochastic Optimization

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Fan, N., Zheng, Q. P., & Pardalos, P. M. (2011). On the two-stage stochastic graph partitioning problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6831 LNCS, pp. 500-509). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6831 LNCS). https://doi.org/10.1007/978-3-642-22616-8_39

On the two-stage stochastic graph partitioning problem. / Fan, Neng; Zheng, Qipeng P.; Pardalos, Panos M.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6831 LNCS 2011. p. 500-509 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6831 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Fan, N, Zheng, QP & Pardalos, PM 2011, On the two-stage stochastic graph partitioning problem. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 6831 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6831 LNCS, pp. 500-509, 5th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2011, Zhangjiajie, China, 8/4/11. https://doi.org/10.1007/978-3-642-22616-8_39
Fan N, Zheng QP, Pardalos PM. On the two-stage stochastic graph partitioning problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6831 LNCS. 2011. p. 500-509. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-22616-8_39
Fan, Neng ; Zheng, Qipeng P. ; Pardalos, Panos M. / On the two-stage stochastic graph partitioning problem. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6831 LNCS 2011. pp. 500-509 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@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",
volume = "6831 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "500--509",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - On the two-stage stochastic graph partitioning problem

AU - Fan, Neng

AU - Zheng, Qipeng P.

AU - Pardalos, Panos M.

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - Graph Partitioning

KW - Integer Programming

KW - Stochastic Optimization

UR - http://www.scopus.com/inward/record.url?scp=80051966229&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80051966229&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-22616-8_39

DO - 10.1007/978-3-642-22616-8_39

M3 - Conference contribution

AN - SCOPUS:80051966229

SN - 9783642226151

VL - 6831 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 500

EP - 509

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -