Author:
Laporte G.,Nobert Y.,Taillefer S.
Reference23 articles.
1. A cutting plane procedure for the travelling salesman problem on road networks;Fleischmann;Eur. J. opl Res.,1985
2. A new class of cutting planes for the symmetric travelling salesman problem;Fleischmann,1983
3. Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph;Miliotis;RAIRO,1981
4. Two exact algorithms for the distance constrained vehicle routing problem;Laporte;Networks,1984
5. The delivery problem: new cutting planes procedures;Gavish;TIMS XXVI Conf.,1984
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献