272 search results - page 33 / 55 » An Approximation Algorithm for a Bottleneck Traveling Salesm... |
MOR
2006
13 years 7 months ago
2006
The comb inequalities are a well-known class of facet-inducing inequalities for the Traveling Salesman Problem, defined in terms of certain vertex sets called the handle and the t...
SODA
2012
ACM
11 years 9 months ago
2012
ACM
In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as...
MP
2007
13 years 6 months ago
2007
Abstract One method which has been used very successfully for finding optimal and provably good solutions for large instances of the Symmetric Travelling Salesman Problem (STSP) i...
EOR
2007
13 years 7 months ago
2007
Professional sports leagues are a major economic activity around the world. Teams and leagues do not want to waste their investments in players and structure in consequence of poo...
SODA
1998
ACM
13 years 8 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...