Nonpolyhedral Relaxations of Graph-Bisection Problems

This publication has 15 references indexed in Scilit:

• Gap Inequalities for the Cut Polytope
  European Journal of Combinatorics, 1996
• A computational study of graph partitioning
  Mathematical Programming, 1994
• The hypermetric cone is polyhedral
  Combinatorica, 1993
• Combinatorial Properties and the Complexity of a Max-cut Approximation
  European Journal of Combinatorics, 1993
• Laplacian eigenvalues and the maximum cut problem
  Mathematical Programming, 1993
• Large-Scale Optimization of Eigenvalues
  SIAM Journal on Optimization, 1992
• An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
  Operations Research, 1988
• On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
  SIAM Journal on Matrix Analysis and Applications, 1988
• The max-cut problem on graphs not contractible to K5
  Operations Research Letters, 1983
• Lower Bounds for the Partitioning of Graphs
  IBM Journal of Research and Development, 1973