✦ LIBER ✦

Uncapacitated single allocation p-hub maximal covering problem

✍ Scribed by Young Ha Hwang; Young Hoon Lee

Book ID: 113536814
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 466 KB
Volume: 63
Category: Article
ISSN: 0360-8352
DOI: 10.1016/j.cie.2012.03.014

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Uncapacitated single and multiple alloca

Uncapacitated single and multiple allocation p-hub center problems

✍ Andreas T. Ernst; Horst Hamacher; Houyuan Jiang; Mohan Krishnamoorthy; Gerhard W 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 243 KB

Stochastic p-robust uncapacitated multip

Stochastic p-robust uncapacitated multiple allocation p-hub location problem

✍ Rahmaniani, Ragheb; Ghaderi, Abdolsalam; Mahmoudi, Naman; Barzinepour, Farnaz 📂 Article 📅 2013 🏛 Inderscience Publishers 🌐 English ⚖ 375 KB

Path relinking approach for multiple all

Path relinking approach for multiple allocation hub maximal covering problem

✍ Bo Qu; Kerui Weng 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 313 KB

We consider the multiple allocation hub maximal covering problem (MAHMCP): Considering a serviced O-D flow was required to reach the destination optionally passing through one or two hubs in a limited time, cost or distance, what is the optimal way to locate p hubs to maximize the serviced flows? By

GRASP for the uncapacitated r-allocation

GRASP for the uncapacitated r-allocation p-hub median problem

✍ Peiró, Juanjo; Corberán, Ángel; Martí, Rafael 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 950 KB

A hybrid heuristic for the uncapacitated

A hybrid heuristic for the uncapacitated single allocation hub location problem

✍ Jeng-Fung Chen 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 218 KB

An efficient memetic algorithm for the u

An efficient memetic algorithm for the uncapacitated single allocation hub location problem

✍ Miroslav Marić, Zorica Stanimirović, Predrag Stanojević 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 800 KB