Henry Wolkowicz's Research

Research Home
Publications & Abstracts
Talks & Presentations
Semidefinite
Programming
EDM
and SNL
Graph
Partitioning

Maximum
Cut

Linear
Programming
Quadratic
Assignment

NLP,
Regularization,
TRS
Set
Partitioning
Matrix
Approximation
Misc. Software/Opt. Matrices
and
Optimization

  Graph Partitioning

 

Projection Technique for Graph Bisection


A Projection Technique for Graph Bisection
is a Fortran program that finds both a good equipartition of a given graph and a bound of the optimum value of this partition.

This is based on a computational based research report (abstract) published in
Mathematical Programming, 1994.

A related theoretical paper, published in Annals of Operations Research, 1995  (abstract) is also available.

A semidefinite programming relaxation paper (abstract) presents improved bounds.

 






Last Modified:  Friday 22 December 2006