The partition problem

In this paper we describe several forms of thek-partition problem and give integer programming formulations of each case. The dimension of the associated polytopes and some basic facets are identified. We also give several valid and facet defining inequalities for each of the polytopes.

[1]  George L. Nemhauser,et al.  Scheduling to Minimize Interaction Cost , 1966, Oper. Res..

[2]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[3]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[6]  M. Garey Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .

[7]  Martin Grötschel,et al.  Facets of the Bipartite Subgraph Polytope , 1985, Math. Oper. Res..

[8]  Ali Ridha Mahjoub,et al.  On the cut polytope , 1986, Math. Program..

[9]  Dorit S. Hochbaum,et al.  Polynomial algorithm for the k-cut problem , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[10]  F. Barahona,et al.  On the magnetisation of the ground states in two dimensional Ising spin glasses , 1988 .

[11]  Yoshiko Wakabayashi,et al.  A cutting plane algorithm for a clustering problem , 1989, Math. Program..

[12]  Martin Grötschel,et al.  Facets of the clique partitioning polytope , 1990, Math. Program..

[13]  M. Grötschel,et al.  Composition of Facets of the Clique Partitioning Polytope , 1990 .

[14]  Antonio Sassano,et al.  The equipartition polytope. II: Valid inequalities and facets , 1990, Math. Program..

[15]  Antonio Sassano,et al.  The equipartition polytope. I: Formulations, dimension and basic facets , 1990, Math. Program..

[16]  Martin Grötschel,et al.  Clique-Web Facets for Multicut Polytopes , 1992, Math. Oper. Res..

[17]  Mihalis Yannakakis,et al.  The complexity of multiway cuts (extended abstract) , 1992, STOC '92.