Nonpolyhedral Relaxations of Graph-Bisection Problems

We study the problem of finding the minimum bisection of a graph into two parts of prescribed sizes. We formulate two lower bounds on the problem by relaxing node- and edge- incidence vectors of cu...

[1]  A. Hoffman,et al.  Lower bounds for the partitioning of graphs , 1973 .

[2]  V. F. Demʹi︠a︡nov,et al.  Introduction to minimax , 1976 .

[3]  H. Wolkowicz,et al.  Some applications of optimization in matrix theory , 1981 .

[4]  F. Barahona The max-cut problem on graphs not contractible to K5 , 1983 .

[5]  Ravi B. Boppana,et al.  Eigenvalues and graph bisection: An average-case analysis , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[6]  Martin Grötschel,et al.  An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design , 1988, Oper. Res..

[7]  M. Overton On minimizing the maximum eigenvalue of a symmetric matrix , 1988 .

[8]  Jochem Zowe,et al.  A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results , 1992, SIAM J. Optim..

[9]  G. Rinaldi,et al.  A cutting plane algorithm for the max-cut problem. , 1992 .

[10]  Michael L. Overton,et al.  Large-Scale Optimization of Eigenvalues , 1990, SIAM J. Optim..

[11]  M. Deza,et al.  The hypermetric cone is polyhedral , 1993, Comb..

[12]  Charles Delorme,et al.  Laplacian eigenvalues and the maximum cut problem , 1993, Math. Program..

[13]  Charles Delorme,et al.  Combinatorial Properties and the Complexity of a Max-cut Approximation , 1993, Eur. J. Comb..

[14]  Zsolt Tuza,et al.  The expected relative error of the polyhedral approximation of the max-cut problem , 1994, Oper. Res. Lett..

[15]  Franz Rendl,et al.  A computational study of graph partitioning , 1994, Math. Program..

[16]  Franz Rendl,et al.  Solving the Max-cut Problem Using Eigenvalues , 1995, Discret. Appl. Math..

[17]  Franz Rendl,et al.  A projection technique for partitioning the nodes of a graph , 1995, Ann. Oper. Res..