.png){kind=icon}
返回
Preprocessing and cutting for multiple allocation hub location problems
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(03)00072-9.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we consider formulations and solution approaches for multiple allocation hub location problems. We present a number of results, which enable us to develop preprocessing procedures and tightening constraints for existing mixed integer linear programming formulations. We employ flow cover constraints for capacitated problems to improve computation times. We present the results of our computational experience, which show that all of these steps can effectively reduce the computational effort required to obtain optimal solutions. (C) 2003 Published by Elsevier B.V.
Keyword:
location
integer programming
hub location
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Solution algorithms for the capacitated single allocation hub location problem容量受限的单分配枢纽选址问题的求解算法
.png){kind=icon}
PREAI
分享收藏Effect of calcination temperature on the properties of CZTS absorber layer prepared by RF sputtering for solar cell applications煅烧温度对射频溅射制备的CZTS吸收层性能的影响
OAAI
OAAI分享收藏分享收藏
查看更多内容