首页> 美国政府科技报告 >Simple Plant Location Problem. A Plea for Balinski's Conjecture
【24h】

Simple Plant Location Problem. A Plea for Balinski's Conjecture

机译:简单的工厂选址问题。对巴林斯基猜想的辩护

获取原文

摘要

The simple plant location (SPL) problem (uncapacitated facility location problem) is studied. The fact that SPL can be considered as a special case of the set partitioning problem is presented. The fact that the linear programming solutions of SPL can be integer solutions (Balinski's conjecture) is discussed. Experiment results are given.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号