A basic variable neighborhood search heuristic for the uncapacitated multiple allocation p-hub center problem
- 28 November 2015
- journal article
- Published by Springer Science and Business Media LLC in Optimization Letters
- Vol. 11 (2), 313-327
- https://doi.org/10.1007/s11590-015-0973-5
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A general variable neighborhood search for solving the uncapacitated $$r$$ r -allocation $$p$$ p -hub median problemOptimization Letters, 2015
- Variable Neighborhood SearchPublished by Springer Science and Business Media LLC ,2010
- Variable neighbourhood search: methods and applicationsAnnals of Operations Research, 2009
- Uncapacitated single and multiple allocation p-hub center problemsComputers & Operations Research, 2009
- Network hub location problems: The state of the artEuropean Journal of Operational Research, 2008
- Hub Location ProblemsPublished by Springer Science and Business Media LLC ,2002
- Hub‐and‐Spoke Networks in Air Transportation: An Analytical ReviewJournal of Regional Science, 1999
- Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problemEuropean Journal of Operational Research, 1998
- Efficient algorithms for the uncapacitated single allocation p-hub median problemLocation Science, 1996
- Optimal design of a distributed network with a two-level hierarchical structureEuropean Journal of Operational Research, 1992