Author:
Kallehauge Brian,Larsen Jesper,Madsen Oli B.G.,Solomon Marius M.
Reference40 articles.
1. Ascheuer, N., Fischetti, M., and Grötschel, M. (2000). Polyhedral study of the asymmetric traveling salesman problem with time windows. Networks 36:69–79.
2. Ascheuer, N., Fischetti, M., and Grötschel, M. (2001). Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Mathematical Programming 90:475–506.
3. Balas, E., Fischetti, M., and Pulleyblank, W.R. (1995). The precedence-constrained asymmetric travelling salesman polytope. Mathematical Programming 68:241–265.
4. Bard, J., Kontoravdis, G., and Yu, G. (2002). A Branch-and-cut procedure for the vehicle routing problem with time windows. Transportation Science 36:250–269.
5. Chabrier, A. (2005). Vehicle routing problem with elementary shortest path based column generation. Forthcoming in: Computers and Operations Research.
Cited by
78 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献