AbstractThe Weiszfeld algorithm is a well-known and widely used method for solving the Weber problem, a two dimensional continuous location problem. Alternative methods based on gradient information are explored, one of which is shown to be a superior alternative to the Weiszfeld algorithm in most cases
In this survey, we examine an important class of facility location problems known as the multisource...
Abstract While travel cost in urban areas is generally best modeled using network distances, continu...
The Weiszfeld algorithm for continuous location problems can be considered as an iteratively reweigh...
AbstractThe Weiszfeld algorithm is a well-known and widely used method for solving the Weber problem...
The Fermat-Weber problem is one of the most widely studied problems in classical location theory. In...
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 20...
The continuous planar facility location problem with the connected region of feasible solutions boun...
The continuous planar facility location problem with the connected region of feasible solutions boun...
The multisource Weber problem is to locate simultaneously m facilities in the Euclidean plane to min...
This paper presents three new heuristic approaches for the solution of the multisourceWeber problem...
In this paper we study a generalized Weber problem where both demand locations and the facility to b...
This paper investigates an unconstrained form of classical Weber problem. The main idea is to reform...
For solving the well-known multi-source Weber problem (MWP), each iteration of the heuristic alterna...
textabstractRosing has recently demonstrated a new method for obtaining optimal solutions to the (Ge...
The Weiszfeld algorithm for continuous location problems can be considered as an iteratively reweigh...
In this survey, we examine an important class of facility location problems known as the multisource...
Abstract While travel cost in urban areas is generally best modeled using network distances, continu...
The Weiszfeld algorithm for continuous location problems can be considered as an iteratively reweigh...
AbstractThe Weiszfeld algorithm is a well-known and widely used method for solving the Weber problem...
The Fermat-Weber problem is one of the most widely studied problems in classical location theory. In...
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 20...
The continuous planar facility location problem with the connected region of feasible solutions boun...
The continuous planar facility location problem with the connected region of feasible solutions boun...
The multisource Weber problem is to locate simultaneously m facilities in the Euclidean plane to min...
This paper presents three new heuristic approaches for the solution of the multisourceWeber problem...
In this paper we study a generalized Weber problem where both demand locations and the facility to b...
This paper investigates an unconstrained form of classical Weber problem. The main idea is to reform...
For solving the well-known multi-source Weber problem (MWP), each iteration of the heuristic alterna...
textabstractRosing has recently demonstrated a new method for obtaining optimal solutions to the (Ge...
The Weiszfeld algorithm for continuous location problems can be considered as an iteratively reweigh...
In this survey, we examine an important class of facility location problems known as the multisource...
Abstract While travel cost in urban areas is generally best modeled using network distances, continu...
The Weiszfeld algorithm for continuous location problems can be considered as an iteratively reweigh...
DOI
Add to ORKG