✦ LIBER ✦

Solution algorithms for the capacitated single allocation hub location problem

✍ Scribed by A.T. Ernst; M. Krishnamoorthy

Book ID: 110380654
Publisher: Springer US
Year: 1999
Tongue: English
Weight: 122 KB
Volume: 86
Category: Article
ISSN: 0254-5330
DOI: 10.1023/a:1018994432663

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Capacitated single allocation hub locati

Capacitated single allocation hub location problem—A bi-criteria approach

✍ Maria da Graça Costa; Maria Eugénia Captivo; João Clímaco 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 510 KB

Lagrangean relaxation for the capacitate

Lagrangean relaxation for the capacitated hub location problem with single assignment

✍ Ivan Contreras; Juan A. Díaz; Elena Fernández 📂 Article 📅 2009 🏛 Springer 🌐 German ⚖ 226 KB

Approximation algorithms for the capacit

Approximation algorithms for the capacitated plant allocation problem

✍ Martine Labbé; E.F. Schmeichel; S.Louis Hakimi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 510 KB

New simple and efficient heuristics for

New simple and efficient heuristics for the uncapacitated single allocation hub location problem

✍ Marcos Roberto Silva; Claudio B. Cunha 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 555 KB

Hybrid algorithms for the uncapacitated

Hybrid algorithms for the uncapacitated continuous location-allocation problem

✍ Mohammad Saeed Jabalameli; Abdolsalam Ghaderi 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 173 KB

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