The p-hub center allocation problem

doi:10.1016/j.ejor.2005.09.024

2007-01-01

PRE

Ann Melissa Campbell *

Timothy J. Lowe

Li Zhang

DOI：10.1016/j.ejor.2005.09.024

原文链接

原文求助

摘要

En 中文

The p-hub center problem is to locate p hubs and to allocate non-hub nodes to hub nodes such that the maximum travel time (or distance) between any origin-destination pair is minimized. We address the p-hub center allocation problem, a subproblem of the location problem, where hub locations are given. We present complexity results and IP formulations for several versions of the problem. We establish that some special cases are polynomially solvable. (c) 2005 Elsevier B.V. All rights reserved.

Keyword:

hub location

networks

complexity theory

AI总结

对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

European Journal of Operational Research

IF:

论文数:

2.2W

被引数:

6.4W

机构

暂无机构信息

引用论文

Solution algorithms for the capacitated single allocation hub location problem 容量受限的单分配枢纽选址问题的求解算法

ANNALS OF OPERATIONS RESEARCH

IF4.5

1999-01-01

257

PREAI

Ernst, AT; Krishnamoorthy, M

Neonatal head injuries: A prospective Paediatric Research in Emergency Departments International Collaborative cohort study

Journal of Paediatrics and Child Health

IF0

2019-12-23

OAAI

Nitaa Eapen; Meredith L Borland; Natalie Phillips; Amit Kochar; Sarah Dalton; John A Cheek; Yuri Gilhotra; Jocelyn Neutze; Mark D Lyttle; Susan Donath; Louise Crowe; Stuart R Dalziel; Ed Oakley; Amanda Williams; Stephen Hearps; Silvia Bressan; Franz E Babl

ALGORITHM-97 - SHORTEST PATH

COMMUNICATIONS OF THE ACM

IF12.2

1962-06-01

2.7K