Solving the continuous p-dispersion problem using non-linear programming

Solving the continuous p-dispersion problem using non-linear programming

0.00 Avg rating0 Votes
Article ID: iaor1996334
Country: United Kingdom
Volume: 46
Issue: 4
Start Page Number: 516
End Page Number: 520
Publication Date: Apr 1995
Journal: Journal of the Operational Research Society
Authors: ,
Keywords: location
Abstract:

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 equivalent to the problem of packing the square with p equal circles of largest possible radius. Computational experience with the non-linear programming formulation of the dispersion problem is reported. Four of the solutions found are superior to the best known solutions in the literature for the corresponding circle-packing problem.

Reviews

Required fields are marked *. Your email address will not be published.