Skip to main content
SpringerLink
Log in

On the Two-Stage Stochastic Graph Partitioning Problem

  • Conference paper
Combinatorial Optimization and Applications (COCOA 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6831))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4, 238–252 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  2. Birge, J.R., Louveaux, F.: Introduction to stochastic programming. Springer, Heidelberg (1997)

    MATH  Google Scholar 

  3. Fan, N., Pardalos, P.M.: Linear and quadratic programming approaches for the general graph partitioning problem. Journal of Global Optimization 48(1), 57–71 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  4. Fan, N., Pardalos, P.M.: Multi-way clustering and biclustering by the Ratio cut and Normalized cut in graphs. Journal of Combinatorial Optimization (2010), doi:10.1007/s10878-010-9351-5

    Google Scholar 

  5. Fan, N., Pardalos, P.M.: Robust optimization of graph partitioning and critical node detection in analyzing networks. In: Wu, W., Daescu, O. (eds.) COCOA 2010, Part I. LNCS, vol. 6508, pp. 170–183. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  6. Frieze, A., Flaxman, A., Krivelevich, M.: On the random 2-stage minimum spanning tree. Random Structures and Algorithms 28, 24–36 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kong, N., Schaefer, A.J.: A factor 1/2 approximation algorithm for two-stage stochastic matching problems. European Journal of Operational Research 172, 740–746 (2006)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, USA

    Neng Fan & Panos M. Pardalos

  2. Department of Industrial and Management Systems Engineering, West Virginia University, Morgantown, WV, USA

    Qipeng P. Zheng

Authors
  1. Neng Fan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qipeng P. Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Panos M. Pardalos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Zhejiang Normal University, 688 Yingbin Road, 321004, Jinhua, Zhejiang Province, China

    Weifan Wang  & Xuding Zhu  & 

  2. Department of Computer Science, University of Texas at Dallas, 75080, Richardson, TX, USA

    Ding-Zhu Du

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fan, N., Zheng, Q.P., Pardalos, P.M. (2011). On the Two-Stage Stochastic Graph Partitioning Problem. In: Wang, W., Zhu, X., Du, DZ. (eds) Combinatorial Optimization and Applications. COCOA 2011. Lecture Notes in Computer Science, vol 6831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22616-8_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22616-8_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22615-1

  • Online ISBN: 978-3-642-22616-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation