𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Solution algorithms for the capacitated single allocation hub location problem

✍ Scribed by A.T. Ernst; M. Krishnamoorthy


Book ID
110380654
Publisher
Springer US
Year
1999
Tongue
English
Weight
122 KB
Volume
86
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A branch and cut algorithm for hub locat
✍ Martine LabbΓ©; Hande Yaman; Eric Gourdin πŸ“‚ Article πŸ“… 2004 πŸ› Springer-Verlag 🌐 English βš– 282 KB

The hub location problem with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. There may also be capacity restrictions on the amount of traffic that can tra