Pages that link to "Item:Q4070998"
From MaRDI portal
The following pages link to Technical Note—Solving Constrained Multi-Facility Location Problems Involving <i>l</i><sub><i>p</i></sub> Distances Using Convex Programming (Q4070998):
Displaying 10 items.
- The minisum location problem on an undirected network with continuous link demands (Q580156) (← links)
- Asymptotic behavior of the Weber location problem on the plane (Q689239) (← links)
- Duality for constrained multifacility location problems with mixed norms and applications (Q920027) (← links)
- Locational analysis (Q1173002) (← links)
- Normative location theory: Placement in continuous space (Q1237028) (← links)
- The convergence of the Weiszfeld algorithm (Q1586265) (← links)
- A generalization of the rectangular bounding method for continuous location models (Q1609171) (← links)
- A fast algorithm for the rectilinear distance location problem (Q1616792) (← links)
- A multifacility location problem on median spaces (Q1917237) (← links)
- Duality in constrained multi‐facility location models (Q4552542) (← links)
