Tabu Search for a Network Loading Problem with Multiple Facilities
Authors:
- 1 June 2000
- journal article
- Published by Springer Nature in Journal of Heuristics
- Vol. 6 (2) , 253-267
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Multicommodity Capacitated Network Design1999
- Tabu Search1997
- A Lagrangean Heuristic Based Branch-and-Bound Method for the Capacitated Network Design Problem1997
- Probabilistic diversification and intensification in local search for vehicle routingJournal of Heuristics, 1995
- Parallel iterative search methods for vehicle routing problemsNetworks, 1993
- The convex hull of two core capacitated network design problemsMathematical Programming, 1993
- Shortest paths, single origin‐destination network design, and associated polyhedraNetworks, 1993
- Networks synthesis and optimum network design problems: Models, solution methods and applicationsNetworks, 1989
- On algorithms for finding the k shortest paths in a networkNetworks, 1979
- A note on two problems in connexion with graphsNumerische Mathematik, 1959