Author:
Abeledo Hernán,Fukasawa Ricardo,Pessoa Artur,Uchoa Eduardo
Publisher
Springer Berlin Heidelberg
Reference31 articles.
1. Picard, J., Queyranne, M.: The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling. Operations Research 26, 86–110 (1978)
2. Vajda, S.: Mathematical Programming. Addison-Wesley, Reading (1961)
3. Pessoa, A., Poggi de Aragão, M., Uchoa, E.: Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems. In: Golden, B., Raghavan, S., Wasil, E. (eds.) The Vehicle Routing Problem: Latest Advances and New Challenges, pp. 297–326. Springer, New York (2008)
4. Pessoa, A., Uchoa, E., Poggi de Aragão, M.: A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem. Networks 54, 167–177 (2009)
5. Pessoa, A., Uchoa, E., Poggi de Aragão, M., Freitas, R.: Algorithms over Arc-time Indexed Formulations for Single and Parallel Machine Scheduling Problems. Technical report RPEP 8(8), Universidade Federal Fluminense, Engenharia de Produção, Niterói, Brazil (2008)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献