5 search results - page 1 / 1 » disopt 2010 |
DISOPT
2010
13 years 4 months ago
2010
DISOPT
2010
13 years 4 months ago
2010
DISOPT
2010
13 years 4 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
DISOPT
2010
13 years 4 months ago
2010
In this paper, a variant of the Traveling Salesman Problem with Time Windows is considered, which consists in minimizing the sum of travel durations between a depot and several cu...
DISOPT
2010
13 years 4 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...