Combinatorial algorithms for some 1-facility median problems in the plane

DOI10.1016/0377-2217(94)90363-8zbMath0822.90095OpenAlexW2071646359MaRDI QIDQ1342072

Stefan Nickel, Horst W. Hamacher

Publication date: 11 January 1995

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90363-8

zbMATH Keywords

facility locationrestrictions in 1-facility median problems in the plane

Mathematics Subject Classification ID

Continuous location (90B85)

Related Items

Optimal bin location and sequencing in printed circuit board assembly ⋮ Bicriteria and restricted 2-facility Weber problems ⋮ Planar weber location problems with line barriers ⋮ Multicommodity flows and Benders decomposition for restricted continuous location problems ⋮ Facility location models for distribution system design ⋮ Error bounds for the approximative solution of restricted planar location problems ⋮ Complexity results on planar multifacility location problems with forbidden regions ⋮ Multicriteria planar location problems ⋮ Geometric methods to solve max-ordering location problems ⋮ Restricted center problems under polyhedral gauges

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mathematical programs with a two-dimensional reverse convex constraint
• The convergence rate of the sandwich algorithm for approximating convex functions
• Optimal bin location and sequencing in printed circuit board assembly
• Sandwich approximation of univariate convex functions with an application to separable convex programming
• Location Theory, Dominance, and Convexity