𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment

✍ Scribed by Contreras, Ivan; Díaz, Juan A.; Fernández, Elena

Book ID
119970399
Publisher
Operations Research Society of America
Year
2011
Tongue
English
Weight
206 KB
Volume
23
Category
Article
ISSN
0899-1499

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