Line facility location in weighted regions

DOI10.1007/s10878-009-9272-3zbMath1219.90136OpenAlexW2163557328MaRDI QIDQ543511

Yam Ki Cheung, Ovidiu Daescu

Publication date: 17 June 2011

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

Full work available at URL: https://doi.org/10.1007/s10878-009-9272-3

zbMATH Keywords

optimizationapproximationline facility locationweighted regions

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for approximate shortest path queries on weighted polyhedral surfaces
• A linear-time algorithm for linear \(L_ 1\) approximation of points
• Computing optimal beams in two and three dimensions
• Approximation algorithms for geometric shortest path problems
• Line Facility Location in Weighted Regions
• Determining approximate shortest paths on weighted polyhedral surfaces
• Querying approximate shortest paths in anisotropic regions
• Parallel Optimal Weighted Links
• MINIMUM SEPARATION IN WEIGHTED SUBDIVISIONS
• Finding Least-Distances Lines
• The weighted region problem
• On finding approximate optimal paths in weighted regions
• Determining an optimal penetration among weighted regions in two and three dimensions

This page was built for publication: Line facility location in weighted regions