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

HernĂ¡n G. Abeledo, Ricardo Fukasawa, Artur Alves Pessoa, Eduardo Uchoa. The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm. In Paola Festa, editor, Experimental Algorithms, 9th International Symposium, SEA 2010, Ischia Island, Naples, Italy, May 20-22, 2010. Proceedings. Volume 6049 of Lecture Notes in Computer Science, pages 202-213, Springer, 2010. [doi]

Abstract

Abstract is missing.