Analisis de heuristicos para el problema del cartero rural-Reference-Cited by-同舟云学术

Analisis de heuristicos para el problema del cartero rural

Published:1985-03 Issue:2 Volume:36 Page:27-38
ISSN:0041-0241
Container-title:Trabajos de Estadistica Y de Investigacion Operativa
language:es
Short-container-title:Trabajos de Estadistica Y de Investigacion Operativa

Author:

Benavent Enrique,Campos Vicente,Corberán Angel,Mota Enrique

Publisher

Springer Science and Business Media LLC

Subject

Statistics, Probability and Uncertainty,Statistics and Probability

Link

http://link.springer.com/content/pdf/10.1007/BF02888609.pdf

Reference8 articles.

1. CHRISTOFIDES, N. (1976): «Worst-case analysis of a new heuristic for the travelling salesman problem». Carnegie-MellonUniv. Rev. WP, 62 75–76.

2. CHRISTOFIDES, N.; CAMPOS, V.; CORBERAN, A., y MOTA, E. (1981): «An algorithm for the Rural Postman Problem».Imperial College Report IC-OR-81-5.

3. CHRISTOFIDES, N.; CAMPOS, V.; CORBERAN, A., y MOTA, E. (1982): «The Directed Rural Postman Problem».Imperial College Report IC-OR-82-4. Pendiente de publicación enMath. Prog. Study.

4. EDMONDS, J., y JOHNSON, E. (1973): «Matching, Euler tours and the Chinese Postman».Math. Prog. 5, 88–124.

5. FISHER, M. (1980): «Worst case analysis of heuristic algorithms»,Man. Sci., vol. 26, no1, 1–17.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Improving a constructive heuristic for the general routing problem;Networks;2022-07-25

2. Reoptimizing the rural postman problem;Computers & Operations Research;2013-05

3. Lower bounds and heuristics for the Windy Rural Postman Problem;European Journal of Operational Research;2007-01

4. Arc Routing: Complexity and Approximability;Arc Routing;2000

5. Algorithms for the rural postman problem;Computers & Operations Research;1995-10