594 search results - page 30 / 119 » Travelling Miser Problem |
CIAC
2010
Springer
13 years 11 months ago
2010
Springer
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides' algorithm and Hoogeve...
AUSSOIS
2001
Springer
14 years 9 days ago
2001
Springer
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open prob...
ESA
1998
Springer
14 years 1 days ago
1998
Springer
Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent ...
SOCO
2007
Springer
14 years 1 months ago
2007
Springer
Aspects require access to the join point context in order to select and adapt join points. For this purpose, current aspect-oriented systems offer a large number of pointcut constr...
CDC
2009
IEEE
14 years 16 days ago
2009
IEEE
—We develop an algorithm aimed at estimating travel time on segments of a road network using a convex optimization framework. Sampled travel time from probe vehicles are assumed ...