| Article ID: | iaor20041227 |
| Country: | Germany |
| Volume: | 95 |
| Issue: | 1 |
| Start Page Number: | 91 |
| End Page Number: | 101 |
| Publication Date: | Jan 2003 |
| Journal: | Mathematical Programming |
| Authors: | Rendl F., Lisser A. |
| Keywords: | semidefinite programming |
Graph partition is used in the telecommunication industry to subdivide a transmission network into small clusters. We consider both linear and semidefinite relaxations for the equipartition problem and present numerical results on real data from France Telecom networks with up 900 nodes, and also on randomly generated problems.