Weber problems with high-speed lines

被引：0
作者：
Mark-Christoph Körner
Anita Schöbel
机构：
[1] Georg-August-University Goettingen,Institute for Numerical and Applied Mathematics
来源：
TOP | 2010年 / 18卷
关键词：
Weber problem; Mixed distance; Time distance; Embedded networks; 90B85;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The Weber problem consists of finding a facility which minimizes the sum of weighted distances from itself to a finite set of given demand points.
引用
收藏
页码：223 / 241
页数：18
相关论文
共 18 条
[1]  
Aichholzer O(2004)Quickest paths, straight skeletons, and the city Voronoi diagram Discrete Comput Geom 31 17-35
[2]  
Aurenhammer F(1997)Weber problems with alternative transportation systems Eur J Oper Res 97 87-93
[3]  
Palop B(2002)Dominating sets for rectilinear center location problems with polyhedral barriers Nav Res Logist 49 647-665
[4]  
Carrizosa E(1985)Geometrical properties of the Fermat–Weber problem Eur J Oper Res 20 332-343
[5]  
Rodriguez-Chia AM(2007)Weber problems with mixed distances and regional demand Math Methods Oper Res 66 419-449
[6]  
Dearing PM(2000)Planar location problems with barriers and block norms Ann Oper Res 96 191-208
[7]  
Hamacher HW(2005)Bilinear programming formulations for Weber problems with continous and network distances J Oper Res Soc Jpn 48 123-134
[8]  
Klamroth K(2008)A unified model for Weber problems with continuous and network distances Comput Oper Res 35 312-326
[9]  
Durier R(undefined)undefined undefined undefined undefined-undefined
[10]  
Michelot C(undefined)undefined undefined undefined undefined-undefined
12