Complexity results on planar multifacility location problems with forbidden regions
From MaRDI portal
Publication:2311127
DOI10.1007/s00186-019-00670-0zbMath1423.90132OpenAlexW2945084782MaRDI QIDQ2311127
Horst W. Hamacher, Andrea Maier
Publication date: 10 July 2019
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-019-00670-0
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Duality for constrained multifacility location problems with mixed norms and applications
- The rectilinear distance Weber problem in the presence of a probabilistic line barrier
- Localization in multifacility location theory
- Geometric interpretation of the optimality conditions in multifacility location and applications
- A comment on a minmax location problem
- Combinatorial algorithms for some 1-facility median problems in the plane
- Handbook of global optimization
- A note on center problems with forbidden polyhedra
- Weber's problem with attraction and repulsion under polyhedral gauges
- Multicommodity flows and Benders decomposition for restricted continuous location problems
- A flexible approach to location problems
- Locating Facilities on the Manhattan Metric with Arbitrarily Shaped Barriers and Convex Forbidden Regions
- Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
- Location Science
- Some optimal inapproximability results
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- Convex analysis and global optimization
- Error bounds for the approximative solution of restricted planar location problems
This page was built for publication: Complexity results on planar multifacility location problems with forbidden regions
