Author:
Petersen Hanne L.,Madsen Oli B.G.
Subject
Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering
Reference23 articles.
1. Implementing the Dantzig–Fulkerson–Johnson algorithm for large traveling salesman problems;Applegate;Mathematical Programming,2003
2. F. Carrabs, R. Cerulli, J.-F. Cordeau, An additive branch-and-bound algorithm for the pickup and delivery traveling salesman problem with LIFO or FIFO loading. INFOR, December 2006 (Publication CIRRELT-2007-12).
3. Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading;Carrabs;INFORMS Journal on Computing,2007
4. Scheduling of vehicles from a central depot to a number of delivery points;Clarke;Operations Research,1964
5. J.-F. Cordeau, M. Iori, G. Laporte, J. Salazar-González, A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading. Networks (to appear).
Cited by
80 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献