𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The single-assignment hub covering problem: Models and linearizations

✍ Scribed by Kara, B. Y. (author);Tansel, B. C. (author)

Book ID
120305280
Publisher
Nature Publishing Group
Year
2003
Tongue
English
Weight
252 KB
Volume
54
Category
Article
ISSN
0160-5682

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A branch and cut algorithm for hub locat
A branch and cut algorithm for hub location problems with single assignment
✍ 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