𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A branch and bound algorithm for class based storage location assignment

✍ Scribed by Venkata Reddy Muppani (Muppant); Gajendra Kumar Adil


Book ID
108118405
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
217 KB
Volume
189
Category
Article
ISSN
0377-2217

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