Polyhedral combinatorics of the K-partitioning problem with representative variables - Archive ouverte HAL Access content directly
Journal Articles Discrete Applied Mathematics Year : 2016

Polyhedral combinatorics of the K-partitioning problem with representative variables

Abstract

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.
Not file

Dates and versions

hal-01759687 , version 1 (10-05-2019)

Identifiers

Cite

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⟩
48 View
1 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More