Many important and valuable planning and scheduling problems in logistics and automation are combinatorial optimization problems. The most famous problem of this type is the traveling salesman problem ...
The Travelling Salesman Problem with Pickups and Deliveries (TSPPD) consists in designing a minimum cost tour that starts at the depot, provides either a pickup or delivery service to each of the ...
This is a preview. Log in through your library . Abstract We consider partitioning algorithms for the approximate solution of large instances of the traveling-salesman problem in the plane. These ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback