The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm. Abeledo, H. G., Fukasawa, R., Pessoa, A. A., & Uchoa, E. In Experimental Algorithms, 9th International Symposium, SEA 2010, Ischia Island, Naples, Italy, May 20-22, 2010. Proceedings, pages 202--213, 2010.
The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/wea/AbeledoFPU10,
  author    = {Hern{\'{a}}n G. Abeledo and
               Ricardo Fukasawa and
               Artur Alves Pessoa and
               Eduardo Uchoa},
  title     = {The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price
               Algorithm},
  booktitle = {Experimental Algorithms, 9th International Symposium, {SEA} 2010,
               Ischia Island, Naples, Italy, May 20-22, 2010. Proceedings},
  pages     = {202--213},
  year      = {2010},
  crossref  = {DBLP:conf/wea/2010},
  url       = {https://doi.org/10.1007/978-3-642-13193-6_18},
  doi       = {10.1007/978-3-642-13193-6_18},
  timestamp = {Wed, 17 May 2017 10:54:02 +0200},
  biburl    = {http://dblp.dagstuhl.de/rec/bib/conf/wea/AbeledoFPU10},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}

Downloads: 0