Publication:2704991

zbMath0971.90041MaRDI QIDQ2704991

Ferran Hurtado, Vera Sacristán, Godfried T. Toussaint

Publication date: 13 May 2001

zbMATH Keywords

maximin; maximin problem; constrained location; constrained versions; Euclidean minimax facility location

Mathematics Subject Classification ID

90C47: Minimax problems in mathematical programming

90B80: Discrete location and assignment

Related Items

Constrained k-Center Problem on a Convex Polygon, A capacitated location-allocation model for flood disaster service operations with border crossing passages and probabilistic demand locations, A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems, An incremental version of the \(k\)-center problem on boundary of a convex polygon, Constrained minimum enclosing circle with center on a query line segment, Fast computation of smallest enclosing circle with center on a query line segment, Some variations on constrained minimum enclosing circle problem, An approximation algorithm for \(k\)-center problem on a convex polygon, Linear time algorithms for Euclidean 1-center in \(\mathfrak {R}^d\) with non-linear convex constraints, A scheme for computing minimum covers within simple regions, The Euclidean \(k\)-supplier problem in \(I R^2\), Linear Time Algorithms for Euclidean 1-Center in $$\mathfrak {R}^d$$ with Non-linear Convex Constraints, Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane, A Scheme for Computing Minimum Covers within Simple Regions