.png){kind=icon}
返回
Single-assignment hub location problems with multiple capacity levels
.png){kind=icon}
PRE
AI
DOI：10.1016/j.trb.2009.12.016.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, an extension of the classical capacitated single-allocation hub location problem is studied in which the size of the hubs is part of the decision making process For each potential hub a set of capacities is assumed to be available among which one can be chosen. Several formulations are proposed for the problem, which are compared in terms of the bound provided by the linear programming relaxation Different sets of inequalities are proposed to enhance the models Several preprocessing tests are also presented with the goal of reducing the size of the models for each particular instance. The results of the computational experiments performed using the proposed models are reported (C) 2009 Elsevier Ltd. All rights reserved
Keyword:
Hub location
Capacity decisions
MILP formulations
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.3
论文数:
3.6K
被引数:
1.9W
机构
引用论文
Solution algorithms for the capacitated single allocation hub location problem容量受限的单分配枢纽选址问题的求解算法
.png){kind=icon}
PREAI
分享收藏Screening effects on the mobility properties in AlGaN/GaN heterostructures with varied Al content
PREAI
分享收藏
A cross decomposition procedure for the facility location problem with a choice of facility type
PREAI
分享收藏
查看更多内容