✦ LIBER ✦

A hybrid heuristic for the uncapacitated single allocation hub location problem

✍ Scribed by Jeng-Fung Chen

Book ID: 113830456
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 218 KB
Volume: 35
Category: Article
ISSN: 0305-0483
DOI: 10.1016/j.omega.2005.05.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A hybrid heuristic for the uncapacitated

A hybrid heuristic for the uncapacitated hub location problem

✍ Sue Abdinnour-Helm 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 991 KB

Given n interacting nodes in a network, the Uncapacitated Hub Location Problem (UHP) determines the number of hubs, the location for the hubs, and the assignment of the spokes to hubs that minimizes the overall transportation cost. The hubs are interconnected and each spoke is assigned to a single h

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

Exact and heuristic algorithms for the u

Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem

✍ Andreas T. Ernst; Mohan Krishnamoorthy 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 919 KB

A dual algorithm for the uncapacitated h

A dual algorithm for the uncapacitated hub location problem

✍ John G. Klincewicz 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 906 KB

Solution algorithms for the capacitated

Solution algorithms for the capacitated single allocation hub location problem

✍ A.T. Ernst; M. Krishnamoorthy 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 122 KB