𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Branch-First, Cut-Second Approach for Locomotive Assignment

✍ Scribed by Ziarati, Koorush; Soumis, François; Desrosiers, Jacques; Solomon, Marius M.

Book ID
127026085
Publisher
INFORMS
Year
1999
Tongue
English
Weight
260 KB
Volume
45
Category
Article
ISSN
0025-1909

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