A polynomial time algorithm for a hemispherical minimax location problem
From MaRDI portal
Publication:1306369
DOI10.1016/S0167-6377(98)00047-9zbMATH Open0956.90015OpenAlexW1966277362MaRDI QIDQ1306369FDOQ1306369
Authors: V. Pereyra
Publication date: 1999
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(98)00047-9
Recommendations
Cites Work
- Efficient Algorithms for the (Weighted) Minimum Circle Problem
- Title not available (Why is that?)
- Optimal location on a sphere
- Minimax and maximin facility location problems on a sphere
- Spherical minimax location problem
- Location Dominance on Spherical Surfaces
- Facility Location on a Sphere
- Spherical minimax location problem using the Euclidean norm: Formulation and optimization
- Solution of an equiweighted minimax location problem on a hemisphere
- An Efficient Geometric Solution to the Minimum Spanning Circle Problem
- Technical Note—On Location Dominance on Spherical Surfaces
- Domain Approximation Method for Solving Multifacility Location Problems on a Sphere
- An algorithm for Weber's problem on the sphere
- Constrained Large-Region Multifacility Location Problems
- Title not available (Why is that?)
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)