A polynomial time algorithm for a hemispherical minimax location problem
From MaRDI portal
Publication:1306369
Recommendations
Cites work
- scientific article; zbMATH DE number 4123493 (Why is no real title available?)
- scientific article; zbMATH DE number 232497 (Why is no real title available?)
- An Efficient Geometric Solution to the Minimum Spanning Circle Problem
- An algorithm for Weber's problem on the sphere
- Constrained Large-Region Multifacility Location Problems
- Domain Approximation Method for Solving Multifacility Location Problems on a Sphere
- Efficient Algorithms for the (Weighted) Minimum Circle Problem
- Facility Location on a Sphere
- Location Dominance on Spherical Surfaces
- Minimax and maximin facility location problems on a sphere
- Optimal location on a sphere
- Solution of an equiweighted minimax location problem on a hemisphere
- Spherical minimax location problem
- Spherical minimax location problem using the Euclidean norm: Formulation and optimization
- Technical Note—On Location Dominance on Spherical Surfaces
Cited in
(4)
This page was built for publication: A polynomial time algorithm for a hemispherical minimax location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306369)