Pages that link to "Item:Q1919190"
From MaRDI portal
The following pages link to A polynomial time dual algorithm for the Euclidean multifacility location problem (Q1919190):
Displaying 6 items.
- Robust solutions to multi-facility Weber location problem under interval and ellipsoidal uncertainty (Q279517) (← links)
- On solving the planar \(k\)-centrum problem with Euclidean distances (Q613427) (← links)
- A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation (Q645558) (← links)
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem (Q1271380) (← links)
- Conditional facility location problems with continuous demand and a polygonal barrier (Q2239930) (← links)
- Two unconstrained optimization approaches for the Euclidean \(\kappa \)-centrum location problem (Q2383649) (← links)
