.png){kind=icon}
返回
Aggregation in hub location problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2009.01.010.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Because of their widespread use in real-world transportation situations, hub location models have been extensively studied in the last two decades. Many types of hub location problems are NP-hard and remain unmanageable when the number of nodes exceeds 200. We present a way to tackle large-sized problems using aggregation, explore the resulting error, and show how to reduce it. Furthermore, we develop a heuristic based on aggregation for k-hub center problems and present computational results. Crown Copyright (C) 2008 Published by Elsevier Ltd. All rights reserved.
Keyword:
Hub location
Aggregation
Heuristics
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容