Author:
Irnich Stefan,Desaulniers Guy
Reference47 articles.
1. Aho, A. and Corasick, M. (1975). Efficient string matching: An aid to bibliographic search. Journal of the ACM, 18(6):333–340.
2. Ahuja, R., Magnanti, T., and Orlin, J.(1993). Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, New Jersey.
3. Arunapuram, S., Mathur, K., and Solow, D.(2003). Vehicle routing and scheduling with full truck loads. Transportation Science, 37(2):170–182.
4. Barnhart, C, Johnson, E., Nemhauser, G., Savelsbergh, M., and Vance, P. (1998). Branch-and-price: Column generation for solving huge integer programs. Operations Research, 46(3):316–329.
5. Beasley, J. and Christofides, N. (1989). An algorithm for the resource constrained shortest path problem. Networks, 19:379–394.
Cited by
245 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献