Solving nonconvex planar location problems by finite dominating sets

DOI10.1023/A:1008395305189zbMath1028.90021MaRDI QIDQ5927662

Rolf Klein, Stefan Nickel, Horst W. Hamacher, Emilio Carrizosa

Publication date: 20 March 2001

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

approximation; continuous location; finite dominating sets; greedy algorithm; polyhedral gauges; sandwich algorithm

Mathematics Subject Classification ID

90B85: Continuous location

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Efficiency in quasiconvex multiobjective nondifferentiable optimization on the real line, Error bounds for the approximative solution of restricted planar location problems, Minmax regret location--allocation problem on a network under uncertainty, Aggregation error for location models: Survey and analysis, Subclasses of solvable problems from classes of combinatorial optimization problems, Planar multifacility location problems with tree structure and finite dominating sets, Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem, A finite dominating set of cardinality \(O(k)\) and a witness set of cardinality \(O(n)\) for 1.5D terrain guarding problem, Weak efficiency in multiobjective quasiconvex optimization on the real-line without derivatives