Pages that link to "Item:Q1001365"
From MaRDI portal
The following pages link to On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems (Q1001365):
Displaying 16 items.
- Continuous location of an assembly station (Q356516) (← links)
- Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams (Q512990) (← links)
- The ordered capacitated facility location problem (Q611009) (← links)
- Cooperative games in facility location situations with regional fixed costs (Q628664) (← links)
- A generalized Weiszfeld method for the multi-facility location problem (Q974995) (← links)
- A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem (Q980366) (← links)
- On the convergence of the generalized Weiszfeld algorithm (Q1026601) (← links)
- Extension of the Weiszfeld procedure to a single facility minisum location model with mixed \(\ell_{p}\) norms (Q1040688) (← links)
- A convergent approximation scheme for efficient sets of the multi-criteria Weber location problem (Q1284597) (← links)
- A note on convergence in the single facility minisum location problem (Q1608453) (← links)
- A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables (Q2255939) (← links)
- New models for locating a moving service facility (Q2500782) (← links)
- Computational Comparison of Two Algorithms for the Euclidean Single Facility Location Problem (Q4015381) (← links)
- (Q4229629) (← links)
- The Weiszfeld Algorithm: Proof, Amendments, and Extensions (Q5506731) (← links)
- Solving the 1-median problem on a network with continuous demand and demand surplus (Q6068730) (← links)