Robust optimization of graph partitioning involving interval uncertainty

The graph partitioning problem consists of partitioning the vertex set of a graph into several disjoint subsets so that the sum of weights of the edges between the disjoint subsets is minimized. In this paper, robust optimization models with two decomposition algorithms are introduced to solve the graph partitioning problem with interval uncertain weights of edges. The bipartite graph partitioning problem with edge uncertainty is also presented. Throughout this paper, we make no assumption regarding the probability of the uncertain weights.

[1]  Panos M. Pardalos,et al.  Topics in Semidefinite and Interior-Point Methods , 1998 .

[2]  Roberto Montemanni,et al.  An exact algorithm for the robust shortest path problem with interval data , 2004, Comput. Oper. Res..

[3]  Melvyn Sim,et al.  Robust discrete optimization and network flows , 2003, Math. Program..

[4]  Qing Zhao,et al.  Semidefinite Programming Relaxations for the Graph Partitioning Problem , 1999, Discret. Appl. Math..

[5]  Franz Rendl,et al.  Graph partitioning using linear and semidefinite programming , 2003, Math. Program..

[6]  Panos M. Pardalos,et al.  Linear and quadratic programming approaches for the general graph partitioning problem , 2010, J. Glob. Optim..

[7]  William W. Hager,et al.  Multiset graph partitioning , 2002, Math. Methods Oper. Res..

[8]  Melvyn Sim,et al.  The Price of Robustness , 2004, Oper. Res..

[9]  Panos M. Pardalos,et al.  Multi-way clustering and biclustering by the Ratio cut and Normalized cut in graphs , 2012, J. Comb. Optim..

[10]  Panos M. Pardalos,et al.  Robust Optimization of Graph Partitioning and Critical Node Detection in Analyzing Networks , 2010, COCOA.

[11]  Hande Yaman,et al.  The robust spanning tree problem with interval data , 2001, Oper. Res. Lett..

[12]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[13]  Allen L. Soyster,et al.  Technical Note - Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming , 1973, Oper. Res..

[14]  A Gerodimos,et al.  Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..