Author of the publication

Lower and upper bounds for the two-echelon capacitated location-routing problem.

, , and . Comput. Oper. Res., 39 (12): 3185-3199 (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Explicit and Emergent Cooperation Schemes for Search Algorithms., and . LION, volume 5313 of Lecture Notes in Computer Science, page 95-109. Springer, (2007)Cooperative Parallel Tabu Search for Capacitated Network Design., and . J. Heuristics, 8 (6): 601-627 (2002)Solution integration in combinatorial optimization with applications to cooperative search and rich vehicle routing., , , , and . J. Heuristics, 21 (5): 663-685 (2015)Dynamic and Stochastic Models for the Allocation of Empty Containers., , and . Operations Research, 41 (1): 102-126 (1993)Time-window relaxations in vehicle routing heuristics., , , and . J. Heuristics, 21 (3): 329-358 (2015)Bundle-based relaxation methods for multicommodity capacitated fixed charge network design., , and . Discret. Appl. Math., 112 (1-3): 73-99 (2001)A Study on Travel Time Stochasticity in Service Network Design with Quality Targets., , , and . ICCL, volume 11184 of Lecture Notes in Computer Science, page 401-416. Springer, (2018)Self-organization in cooperative tabu search algorithms., , , and . SMC, page 2379-2384. IEEE, (1998)The single-node dynamic service scheduling and dispatching problem., , , and . Eur. J. Oper. Res., 170 (1): 1-23 (2006)A unified solution framework for multi-attribute vehicle routing problems., , , and . Eur. J. Oper. Res., 234 (3): 658-673 (2014)