A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem
Authors:
- Aleksandar IlićAIAleksandar Ilić
- Dragan UroševićDUDragan Urošević
- Jack BrimbergJBJack Brimberg
- Nenad MladenovićNMNenad Mladenović
- 1 October 2010
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 206 (2) , 289-300
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- A 2-phase algorithm for solving the single allocation p-hub center problemComputers & Operations Research, 2009
- Variable neighborhood searchEuropean Journal of Operational Research, 2008
- Variable neighbourhood search: methods and applications4OR, 2008
- Network hub location problems: The state of the artEuropean Journal of Operational Research, 2008
- Two genetic algorithms for solving the uncapacitated single allocation p-hub median problemEuropean Journal of Operational Research, 2007
- A hybrid VNS–path relinking for the p-hub median problemIMA Journal of Management Mathematics, 2007
- Variable neighborhood search: Principles and applicationsEuropean Journal of Operational Research, 2001
- Variable neighborhood searchComputers & Operations Research, 1997
- Avoiding local optima in thep-hub location problem using tabu search and GRASPAnnals of Operations Research, 1992
- A quadratic integer program for the location of interacting hub facilitiesEuropean Journal of Operational Research, 1987