Mathematical Programming

, Volume 95, Issue 1, pp 91–101

Graph partitioning using linear and semidefinite programming

  • A. Lisser
  • F. Rendl

DOI: 10.1007/s10107-002-0342-x

Cite this article as:
Lisser, A. & Rendl, F. Math. Program., Ser B (2003) 95: 91. doi:10.1007/s10107-002-0342-x
  • 244 Downloads

Abstract.

 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.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • A. Lisser
    • 1
  • F. Rendl
    • 2
  1. 1.Laboratorie de Recherche en Informatique, Université Paris Sud, Orsay Cedex FranceFR
  2. 2.Institut für Mathematik, Universität Klagenfurt, A – 9020 Klagenfurt, AustriaAT

Personalised recommendations