Covering problems with polyellipsoids: a location analysis perspective
From MaRDI portal
Publication:2028797
DOI10.1016/j.ejor.2020.06.048zbMath1487.90452arXiv1910.13428OpenAlexW3038746152MaRDI QIDQ2028797
Publication date: 3 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.13428
Mixed integer programming (90C11) Continuous location (90B85) Inventory, storage, reservoirs (90B05) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Related Items
On hub location problems in geographically flexible networks ⋮ Fairness in maximal covering location problems ⋮ Multi-type maximal covering location problems: hybridizing discrete and continuous problems ⋮ An elliptical cover problem in drone delivery network design and its solution algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
- Minimizing ordered weighted averaging of rational functions with applications to continuous location
- Support vector data description
- Generalized coverage: new developments in covering location models
- Convex ordered median problem with \(\ell _p\)-norms
- On a circle placement problem
- Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
- Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions
- Deterministic and stochastic global optimization techniques for planar covering with ellipses problems
- The Weighted Euclidean 1-Center Problem
- Using Block Norms for Location Modeling
- Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
- Note—On a Modified One-Center Model
- Efficient Algorithms for the (Weighted) Minimum Circle Problem
- Polyconics. I. Polyellipses and optimization
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
- On the generalization of Erdos-Vincze’s theorem about the approximation of regular triangles by polyellipses in the plane
