On the Solution of a Graph Partitioning Problem under Capacity Constraints

Pierre Bonami Viet Hung Nguyen 1 Michel Klein Michel Minoux 1
1 DECISION
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : We study a variant of the graph partitioning problem where the weight of a cluster in the partition depends on the edges incident to its nodes. This problem was first proposed in the context of optical networks design. We recall complexity results and establish new inaproximability results. We then study several mixed integer quadratic programming formulations for the problem and different solutions techniques. We present experimental results comparing the various formulations and solution techniques.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01272895
Contributor : Lip6 Publications <>
Submitted on : Thursday, February 11, 2016 - 3:08:06 PM
Last modification on : Thursday, March 21, 2019 - 12:59:39 PM

Identifiers

Citation

Pierre Bonami, Viet Hung Nguyen, Michel Klein, Michel Minoux. On the Solution of a Graph Partitioning Problem under Capacity Constraints. ISCO 2012, Apr 2012, Athens, Greece. pp.285-296, ⟨10.1007/978-3-642-32147-4_26⟩. ⟨hal-01272895⟩

Share

Metrics

Record views

52