Ricardo Fukasawa
Ricardo Fukasawa
Home
Publications
Students
Teaching
Contact
The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm
H. Abeledo
,
R. Fukasawa
,
A. Pessoa
,
E. Uchoa
January 2013
Preprint
Cite
DOI
Type
Journal article
Publication
Mathematical Programming Computation
, vol 5(1), pp.27-55, 2013
BCP
Routing
Related
The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm
Robust branch-and-cut-and-price for the Capacitated Vehicle Routing Problem
Robust Branch-Cut-and-Price for the Capacitated Minimum Spanning Tree Problem over a Large Extended Formulation
Cite
×