The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm

H. Abeledo, R. Fukasawa, A. Pessoa, E. Uchoa
January 2010
DOI
Type
Conference paper
Publication
In Proceedings of the SEA 2010, Naples, Italy. Lecture Notes in Computer Science vol 6049, pp.202-213, 2010
BCP Routing

Related