In this paper we describe several forms of the k-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 po
lytopes.