Buscar
Mostrando ítems 1-10 de 137
The open capacitated arc routing problem
(2009-01-01)
The open capacitated arc routing problem
(Pergamon-elsevier Science LtdOxfordInglaterra, 2011)
The open capacitated arc routing problem
(Pergamon-Elsevier B.V. Ltd, 2011-11-01)
The Open Capacitated Arc Routing Problem (OCARP) is a NP-hard combinatorial optimization problem where, given an undirected graph, the objective is to find a minimum cost set of tours that services a subset of edges with ...
The open capacitated arc routing problem
(Pergamon-Elsevier B.V. Ltd, 2011-11-01)
The Open Capacitated Arc Routing Problem (OCARP) is a NP-hard combinatorial optimization problem where, given an undirected graph, the objective is to find a minimum cost set of tours that services a subset of edges with ...
The open capacitated arc routing problem
(Pergamon-Elsevier B.V. Ltd, 2014)
GRASP with evolutionary path-relinking for the capacitated arc routing problem
(2011-10-31)
The Capacitated Arc Routing Problem (CARP) is a well-known NP-hard combinatorial optimization problem where, given an undirected graph, the objective is to find a minimum cost set of tours servicing a subset of required ...
GRASP with evolutionary path-relinking for the capacitated arc routing problem
(2011-10-31)
The Capacitated Arc Routing Problem (CARP) is a well-known NP-hard combinatorial optimization problem where, given an undirected graph, the objective is to find a minimum cost set of tours servicing a subset of required ...