New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem |
| |
| Authors: | Sergio Garcí a,Mercedes Landete,Alfredo Marí n |
| |
| Affiliation: | 1. Departamento de Estadística, Universidad Carlos III de Madrid, Spain;2. Departamento de Estadística, Matemáticas e Informática, Centro de Investigación Operativa, Universidad Miguel Hernández de Elche, Spain;3. Departamento de Estadística e Investigación Operativa, Universidad de Murcia, Spain |
| |
| Abstract: | ![]()
This article deals with the uncapacitated multiple allocation p-hub median problem, where p facilities (hubs) must be located among n available sites in order to minimize the transportation cost of sending a product between all pairs of sites. Each path between an origin and a destination can traverse any pair of hubs. |
| |
| Keywords: | Hub location Discrete location Integer programming |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
