The problem of locating p maximally dispersed points in a convex space is considered. This problem is formulated as a non-linear programming problem. It is shown that this problem, in a square, is ...
This is a preview. Log in through your library . Abstract A new bounding procedure for the Quadratic Assignment Problem (QAP) is described which extends the Hungarian method for the Linear Assignment ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback