The Node Packing Problem is an extremely important problem given that
it comprises the underlying structure of numerous optimization problem
s either directly or indirectly. This paper presents a constraint appr
oach which produces new facets for the Node Packing Problem. A number
of different problem applications, are solved incorporating this new c
onstraint approach using a commercial software package on a personal c
omputer demonstrating the effectiveness of the underlying facets in pr
actice. The new facet structures provide a means for addressing genera
l dispersion and separation requirements using mathematical programmin
g, (C) 1997 Elsevier Science B.V.