Sciweavers

MP
2010
145views more  MP 2010»
13 years 3 months ago
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
Irina Dumitrescu, Stefan Ropke, Jean-Franço...
COR
2007
112views more  COR 2007»
13 years 4 months ago
The bi-objective covering tour problem
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
Nicolas Jozefowiez, Frédéric Semet, ...