Semidefinite programming relaxations for the graph partitioning problem

This publication has 14 references indexed in Scilit:

• A recipe for semidefinite relaxation for (0,1)-quadratic programming
  Journal of Global Optimization, 1995
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
  SIAM Journal on Optimization, 1995
• A computational study of graph partitioning
  Mathematical Programming, 1994
• A lift-and-project cutting plane algorithm for mixed 0–1 programs
  Mathematical Programming, 1993
• An efficient eigenvector approach for finding netlist partitions
  IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992
• Cones of Matrices and Set-Functions and 0–1 Optimization
  SIAM Journal on Optimization, 1991
• Very fast simulated re-annealing
  Mathematical and Computer Modelling, 1989
• Cones of diagonally dominant matrices
  Pacific Journal of Mathematics, 1975
• The lattice of faces of a finite dimensional cone
  Linear Algebra and its Applications, 1973
• An Efficient Heuristic Procedure for Partitioning Graphs
  Bell System Technical Journal, 1970