Lower Bounds for the Uncapacitated Facility Location Problem with User Preferences
Lower Bounds for the Uncapacitated Facility Location Problem with User Preferences
复制标题
具有用户偏好的无能力设施位置问题的下限
DOI：
--
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
Y. Kochetov
中科院分区：
文献类型：
--
作者：
P. Hansen;N. Mladenović;Y. Kochetov
我们考虑使用用户偏好的双重功能的设施位置问题。众所周知，该模型可能被重新构成具有一些其他约束的单层位置问题。在本文中，我们介绍了一种新的重新重新制定，并表明，从线性编程放松的角度来看，这种重新印象是先前的三个重新构造，并且可能比减少对成对矩阵的行选择问题的更糟。但是，这最后的减少需要许多其他变量和约束。在随机数据实例上进行的计算实验表明，新的重新印度可以找到比以前所有方法更快的二聚体位置问题的最佳解决方案。
We consider the bilevel uncapacitated facility location problem with user preferences. It is known that this model may be reformulated as a one-level location problem with some additional constraints. In this paper we introduce a new reformulation and show that this reformulation dominates three previous ones from the point of view of their linear programming relaxations and may be worse than a reduction to the row selection problem for pairs of matrices. However, this last reduction requires many additional variables and constraints. Computational experiments on random data instances shows that the new reformulation allows to find an optimal solution of the bilevel location problem considered faster than all previous approaches.