𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lagrangean relaxation for the capacitated hub location problem with single assignment

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

Publisher
Springer
Year
2009
Tongue
German
Weight
226 KB
Volume
31
Category
Article
ISSN
0171-6468

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