Polyhedral combinatorics of the -partitioning problem with representative variables
Authors:
- Zacharie AlesZAZacharie Ales
- Arnaud KnippelAKArnaud Knippel
- Alexandre PauchetAPAlexandre Pauchet
- 1 October 2016
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 211, 1-14
Abstract
No abstract availableKeywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Linear and quadratic programming approaches for the general graph partitioning problemJournal of Global Optimization, 2010
- On the asymmetric representatives formulation for the vertex coloring problemDiscrete Applied Mathematics, 2008
- Lifting theorems and facet characterization for a class of clique partitioning inequalitiesOperations Research Letters, 1999
- The node capacitated graph partitioning problem: A computational studyMathematical Programming, 1998
- Formulations and valid inequalities for the node capacitated graph partitioning problemMathematical Programming, 1996
- The partition problemMathematical Programming, 1993
- The equipartition polytope. I: Formulations, dimension and basic facetsMathematical Programming, 1990
- A cutting plane algorithm for a clustering problemMathematical Programming, 1989
- On the cut polytopeMathematical Programming, 1986
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976