Facets for node packing

The Node Packing Problem is an extremely important problem given that its comprises the underlying structure of numerous optimization problems either directly or indirectly. This paper presents a constraint approach which produces new facets for the Node Packing Problem. A number of different problem applications are solved incorporating this new constrant approach using a commercial software package on a personal computer demonstrating the effectiveness of the underlying facets in practice. The new facet structures provide a means for addressing general dispersion and separation requirements using mathematical programming.