Subject
Management Science and Operations Research,Modelling and Simulation,General Computer Science
Reference44 articles.
1. Approximation algorithms for some routing problems;Frederickson;SIAM Journal on Computing,1978
2. Ahr D, Reinelt G. New heuristics and lower bounds for the min–max k-Chinese postman problem. In: Möring R, Raman R, editors. Algorithms—ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17–21, 2002. Proceedings, Lecture notes in computer science, vol. 2461. Berlin: Springer; 2002. p. 64–74.
3. Heuristic for integer programming using surrogate constraints;Glover;Decision Science,1977
4. Future paths for integer programming and links to artificial intelligence;Glover;Computers & Operations Research,1986
5. Tabu search, Part I;Glover;ORSA Journal on Computing,1990
Cited by
40 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献