首页> 外文会议>International Conference on Algorithmic Applications in Management(AAIM 2005); 20050622-25; Xian(CN) >An Approximation Algorithm for a Facility Location Problem with Inventories and Stochastic Demands
【24h】

An Approximation Algorithm for a Facility Location Problem with Inventories and Stochastic Demands

机译:具有库存和随机需求的设施选址问题的一种近似算法

获取原文
获取原文并翻译 | 示例

摘要

In this article we propose, for any ε > 0, a 2(1+ε)-approxima-tion algorithm for a facility location problem with stochastic demands. At open facilities, inventory is kept such that arriving requests find a zero inventory with (at most) some pre-specified probability. The incurred costs are the expected transportation costs from the demand points to the facilities, the operating costs of the facilities and the investment in inventory.
机译:在本文中,对于任意ε> 0的情况,我们提出了一种针对具有随机需求的设施选址问题的2(1 +ε)近似算法。在开放的设施中,将保留库存,以便到达的请求找到(最多)具有一定预定概率的零库存。发生的成本是指从需求点到设施的预期运输成本,设施的运营成本以及库存投资。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号