303 search results - page 46 / 61 » Traveling Salesman Problem with Transportation |
107
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
: The PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints....
131
click to vote
TAMC
2009
Springer
15 years 6 months ago
2009
Springer
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
125
click to vote
STACS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...
106
click to vote
ENGL
2007
15 years 1 months ago
2007
— As is the trend worldwide, India is undergoing rapid urbanization. This means not only that more people than ever before will be living and working in cities, but also that mor...
127
click to vote
ESA
2008
Springer
15 years 3 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...