Author:
Cheng Xu,Tang Lixin,Pardalos Panos M.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Management Science and Operations Research,Control and Optimization,Computer Science Applications
Reference14 articles.
1. Aron, I.D., Genç-Kaya L., Harjunkoski, I., Hoda, S., Hooker, J.N.: Factory Crane Scheduling by Dynamic Programming. Tepper School of Business, Paper 1387 (2010)
2. Balas, E., Fischetti, M., Pulleyblank, W.R.: The precedence-constrained asymmetric traveling salesman polytope. Math. Program. 68(1–3), 241–265 (1995)
3. Cordeau, J.-F.: A Branch-and-Cut algorithm for the Dial-a-Ride problem. Op. Res. 54(3), 573–586 (2006)
4. Cordeau, J.-F., Iori, M., Laporte, G., Salazar-González, J.J.: A Branch-and-Cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading. Networks 55(1), 46–59 (2010)
5. Dumitrescu, I., Ropke, S., Cordeau, J.-F., Laporte, G.: The traveling salesman problem with pickup and delivery: polyhedral results and a Branch-and-Cut algorithm. Math. Program. 121(2), 269–305 (2008)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献