𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A specialized branch & bound & cut for Single-Allocation Ordered Median Hub Location problems

✍ Scribed by Puerto, J.; Ramos, A.B.; Rodríguez-Chía, A.M.

Book ID
121217107
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
602 KB
Volume
161
Category
Article
ISSN
0166-218X

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