• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Algorithmic Applications in Management(AAIM 2005); 20050622-25; Xian(CN) >Facility Location in a Global View
【24h】

Facility Location in a Global View

机译：全球视野中的设施位置

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Facility Location Problems have always been studied with the assumption that the environment in the network is static and does not change over time. In practice, however, the environment is usually dynamic and we must consider the facility location in a global view. In this paper, we impose the following additional constraints on input facilities: the total number of facilities to be placed is not known in advance and a facility cannot be removed once it is placed. We solve this problem by presenting an algorithm to find a facility permutation such that any prefix of the permutation of facilities is near-optimal over any other facility subset.
机译：一直在假设网络中的环境是静态的并且不会随时间变化的前提下研究设施位置问题。但是，实际上，环境通常是动态的，我们必须从全局角度考虑设施的位置。在本文中，我们对输入设施施加了以下附加约束：预先未知要放置的设施总数，并且一旦放置设施便无法删除。我们通过提出一种算法来找到设施置换来解决此问题，以使设施置换的任何前缀在任何其他设施子集上都接近最佳。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号