A modified Weiszfeld algorithm for the Fermat–Weber location problem

A modified Weiszfeld algorithm for the Fermat–Weber location problem

0.00 Avg rating0 Votes
Article ID: iaor2002564
Country: Germany
Volume: 90
Issue: 3
Start Page Number: 559
End Page Number: 566
Publication Date: Jan 2001
Journal: Mathematical Programming
Authors: ,
Keywords: Weber problem
Abstract:

This paper gives a new, simple, monotonically convergent, algorithm for the Fermat–Weber location problem, with extensions covering more general cost functions.

Reviews

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