A discretizing algorithm for location-problems

A discretizing algorithm for location-problems

0.00 Avg rating0 Votes
Article ID: iaor19981087
Country: Netherlands
Volume: 80
Issue: 1
Start Page Number: 166
End Page Number: 174
Publication Date: Jan 1995
Journal: European Journal of Operational Research
Authors: ,
Abstract:

A new and simple methodology is proposed to solve both constrained and unconstrained planar continuous single-facility location problems. As particular instances, the classical location problems with mixed gauges can be solved. Theoretical convergence is proved, and numerical examples are given, showing a fast convergence in a small number of steps.

Reviews

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