Article Dans Une Revue Discrete Applied Mathematics Année : 2016

Polyhedral combinatorics of the K-partitioning problem with representative variables

Résumé

The K-partitioning problem consists in partitioning the vertices of a weighted graph in K sets in order to minimize a function related to the edge weights. We introduce a linear mixed integer formulation with edge variables and representative variables. We investigate the polyhedral combinatorics of the problem, study several families of facet-defining inequalities and evaluate their efficiency on the linear relaxation.

Fichier principal
Vignette du fichier
ales2016polyhedral.pdf (328.52 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-01759687 , version 1 (29-06-2023)

Licence

Identifiants

Citer

Zacharie Alès, Arnaud Knippel, Alexandre Pauchet. Polyhedral combinatorics of the K-partitioning problem with representative variables. Discrete Applied Mathematics, 2016, 211, pp.1 - 14. ⟨10.1016/j.dam.2016.04.002⟩. ⟨hal-01759687⟩
188 Consultations
202 Téléchargements

Altmetric

Partager

  • More