Author:
Ponboon Sattrawut,Qureshi Ali Gul,Taniguchi Eiichi
Reference65 articles.
1. Akca, Z., Berger, R., & Ralphs, T. (2009). A Branch-and-Price Algorithm for Combined Location and Routing Problems under Capacity Restrictions. In J. Chinneck, B. Kristjansson, M. Saltzman, J.W. Chinneck, B. Kristjansson, & M. J. Saltzman (Eds.), Operations Research and Cyber-Infrastructure (Vol. 47, pp. 309-330). Springer US. doi:10.1007/978-0-387-88843-9_16.
2. Computational experience with branch exchange heuristics for vehicle routing problems with time window constraints;Baker;American Journal of Mathematical and Management Sciences,1986
3. Integrated facility location and vehicle routing models: Recent work and future prospects;Balakrishman;American Journal of Mathematical and Management Sciences,1987
4. An Exact Method for the Capacitated Location-Routing Problem;Baldacci;Operations Research,2011
5. A Branch-and-Cut Method for the Capacitated Location-Routing Problem;Belengure;Computers & Operations Research,2011
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献