Author:
Hasle Geir,Kloster Oddvar
Publisher
Springer Berlin Heidelberg
Reference49 articles.
1. E. H. L. Aarts and J. K. Lenstra (eds). Local Search in Combinatorial Optimization. Wiley-Interscience Series in Discrete Mathematics and Optimization, ISBN 0-471-94822-5, 1997.
2. R. Ahuja, O. Ergun, J. Orlin, and A. Punnen. A Survey of very large-scale neighborhood search techniques. Discrete Appl. Math., 1(23):75–102, 2002.
3. P. Augerat, J. M. Belenguer, E. Benavent, A. Corbéran, D. Naddef. Separating capacity constraints in the CVRP using tabu search. European J. Oper. Res., 106:546–557, 1998.
4. C. Barnhart, E. Johnson, G. Nemhauser, M. Savelsbergh, and P. Vance. Branchand-price: Column generation for solving huge integer programs. Oper. Res., 46(3):316–329, 1998.
5. M. Bellmore and S. Hong. Transformation of the multisalesmen problem to the standard traveling salesman problem. J. ACM, 21(3), 500–504, 1974.
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献