272 search results - page 25 / 55 » An Approximation Algorithm for a Bottleneck Traveling Salesm... |
FLAIRS
2010
13 years 5 months ago
2010
The choice of a good annealing schedule is necessary for good performance of simulated annealing for combinatorial optimization problems. In this paper, we pose the simulated anne...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...
ESA
2008
Springer
13 years 9 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...
GECCO
2009
Springer
14 years 15 hour ago
2009
Springer
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
STOC
2002
ACM
14 years 7 months ago
2002
ACM
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...