New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem

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.

MoreLess

Year of publication:	2012
Authors:	García, Sergio ; Landete, Mercedes ; Marín, Alfredo
Published in:	European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 220.2012, 1, p. 48-57
Publisher:	Elsevier
Subject:	Hub location \| Discrete location \| Integer programming

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10011052438