Ricardo Fukasawa
Ricardo Fukasawa
Home
Publications
Students
Teaching
Contact
Robust branch-and-cut-and-price for the capacitated vehicle routing problem
R. Fukasawa
,
J. Lysgaard
,
M. Poggi de Aragão
,
M. Reis
,
E. Uchoa
,
R. F. Werneck
January 2004
Cite
DOI
Type
Conference paper
Publication
In
Proceedings of the tenth Integer Programming and Combinatorial Optimization conference IPCO'04, New York, Lecture Notes in Computer Science
vol 3064, pp.1-15, 2004
Computations
BCP
Routing
Related
Robust branch-and-cut-and-price for the Capacitated Vehicle Routing Problem
The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm
The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm
Robust Branch-Cut-and-Price for the Capacitated Minimum Spanning Tree Problem over a Large Extended Formulation
On the exact separation of mixed-integer knapsack cuts
Cite
×