沃罗诺图
多边形(计算机图形学)
欧几里德几何
设施选址问题
正多边形
数学优化
计算机科学
平面(几何)
点在多边形内
多项式的
单中心问题
多样性(控制论)
数学
几何学
人工智能
电信
帧(网络)
数学分析
作者
Igor Averbakh,Oded Berman,Jörg Kalcsics,Dmitry Krass
出处
期刊:Operations Research
[Institute for Operations Research and the Management Sciences]
日期:2015-03-02
卷期号:63 (2): 394-411
被引量:15
标识
DOI:10.1287/opre.2015.1354
摘要
We consider facility location problems where the demand is continuously and uniformly distributed over a convex polygon with m vertices in the rectilinear plane, n facilities are already present, and the goal is to find an optimal location for an additional facility. Based on an analysis of structural properties of incremental Voronoi diagrams, we develop polynomial exact algorithms for five conditional location problems. The developed methodology is applicable to a variety of other facility location problems with continuous demand. Moreover, we briefly discuss the Euclidean case.
科研通智能强力驱动
Strongly Powered by AbleSci AI