Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem (2003)
Ricardo Fukasawa, Jens Lysgaard, Marcelo Reis, Marcus Poggi, Aragão Marcelo Reis, ...
The best exact algorithms for the capacitated Vehicle Routing Problem (CVRP) have been based on either branch-and-cut or Lagrangean relaxation/column generation. This paper presents an algorithm that...
New Benchmark Instances for the Steiner Problem in Graphs (2001)
Isabel Rosseti Marcus, Marcus Poggi, Aragão Celso, C. Ribeiro, Eduardo Uchoa, Renato F. Werneck
This paper proposes three new series of benchmark instances that will hopefully lead to a better assessment of exact and approximate algorithms for the SPG. Even though some of them are somewhat...
Hybrid Local Search for the Steiner Problem in Graphs (2001)
Celso C. Ribeiro, Marcus Poggi, Aragão Celso, C. Ribeiro, Eduardo Uchoa, ...
Introduction Let G =(V,E) be a connected undirected graph, where V is the set of nodes and E denotes the set of edges. Given a non-negative weight function w : E IR + associated with its edges and a...