332 search results - page 45 / 67 » Traveling salesman path problems |
SODA
2010
ACM
14 years 5 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
This paper proposes and solves the Time-Interval All Fastest Path (allFP) query. Given a user-defined leaving or arrival time interval I, a source node s and an end node e, allFP ...
LION
2009
Springer
14 years 2 months ago
2009
Springer
Beam-ACO algorithms are hybrid methods that combine the metaheuristic ant colony optimization with beam search. They heavily rely on accurate and computationally inexpensive boundi...
MP
2010
13 years 6 months ago
2010
Combinatorial optimization games form an important subclass of cooperative games. In recent years, increased attention has been given to the issue of finding good cost shares for...
IEAAIE
2005
Springer
14 years 1 months ago
2005
Springer
The preservation of common components has been recently isolated as a beneficial feature of genetic algorithms. One interpretation of this benefit is that the preservation of commo...