The p-center problem under locational uncertainty of demand points

IF 0.9 4区数学 Q3 MATHEMATICS, APPLIED Discrete Optimization Pub Date : 2023-01-01 DOI:10.1016/j.disopt.2023.100759

Homa Ataei , Mansoor Davoodi

引用次数: 0

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

需求点位置不确定下的p中心问题

p中心问题是在一组n个需求点中找到p个设施的位置，从而使任何需求点与其最近设施之间的最大距离最小化。在本文中，我们在不确定性的背景下研究了这个问题，即需求点的位置可能在像圆盘或线段这样的区域中发生变化，或者属于有限的点集。我们引入了最大中心和最小中心问题，它们是在这种位置不确定性下p中心问题的最坏和最好的可能解。我们提出了在欧氏度量下求解这些问题的近似算法和参数化算法。此外，我们研究了不确定条件下的MinMax Regret 1-中心问题，并提出了曼哈顿度量下的线性时间算法和欧几里得度量下的O（n4）时间算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Discrete Optimization 管理科学-应用数学

CiteScore

2.10

自引率

9.10%

发文量

审稿时长

>12 weeks

期刊介绍： Discrete Optimization publishes research papers on the mathematical, computational and applied aspects of all areas of integer programming and combinatorial optimization. In addition to reports on mathematical results pertinent to discrete optimization, the journal welcomes submissions on algorithmic developments, computational experiments, and novel applications (in particular, large-scale and real-time applications). The journal also publishes clearly labelled surveys, reviews, short notes, and open problems. Manuscripts submitted for possible publication to Discrete Optimization should report on original research, should not have been previously published, and should not be under consideration for publication by any other journal.

期刊最新文献

Approximation schemes for Min-Sum k-Clustering Easy and hard separation of sparse and dense odd-set constraints in matching Mostar index and bounded maximum degree Two-set inequalities for the binary knapsack polyhedra Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations