Optimization Online


Exploiting sparsity for the min k-partition problem

Guanglei Wang (guanglei.wang***at***anu.edu.au)
Hassan Hijazi (hlh***at***lanl.gov)

Abstract: The minimum k-partition problem is a challenging combinatorial problem with a diverse set of applications ranging from telecommunications to sports scheduling. It generalizes the max-cut problem and has been extensively studied since the late sixties. Strong integer formulations proposed in the literature suffer from a prohibitive number of valid inequalities and integer variables. In this work, we introduce two compact integer linear and semidefinite reformulations that exploit the sparsity of the underlying graph and develop fundamental results leveraging the power of chordal decomposition. Numerical experiments show that the new formulations improve upon state-of-the-art.

Keywords: Integer programming, Minimum k partition, Semidefinite programming, Chordal Decomposition

Category 1: Integer Programming (0-1 Programming )

Category 2: Linear, Cone and Semidefinite Programming (Semi-definite Programming )


Download: [PDF]

Entry Submitted: 09/01/2017
Entry Accepted: 09/01/2017
Entry Last Modified: 09/01/2017

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society