Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
- 16 July 2000
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 124 (2), 360-376
- https://doi.org/10.1016/s0377-2217(99)00170-8
Abstract
No abstract availableThis publication has 28 references indexed in Scilit:
- Simulated annealing: An introductionStatistica Neerlandica, 1989
- Formulations and Algorithms for the Capacitated Minimal Directed Tree ProblemJournal of the ACM, 1983
- Capacitated arc routing problemsNetworks, 1981
- Second-Order Greedy Algorithms for Centralized Teleprocessing Network DesignIEEE Transactions on Communications, 1980
- The complexity of the capacitated tree problemNetworks, 1978
- On the complexity of edge traversingJournal of the ACM, 1976
- A taxonomic structure for vehicle routing and scheduling problemsComputers & Urban Society, 1975
- The optimum traversal of a graphOmega, 1973
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956