52 search results - page 8 / 11 » Computing with Domino-Parity Inequalities for the Traveling ... |
SASO
2007
IEEE
14 years 1 months ago
2007
IEEE
Multi-agent systems (MAS) provide a promising technology for addressing problems such as search and rescue missions, mine sweeping, and surveillance. These problems are a form of ...
FOCS
2003
IEEE
14 years 23 days ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We discuss how phase-transitions may be detected in computationally hard problems in the context of anytime algorithms. Treating the computational time, value and utility functions...
AAIM
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. This paper presents an iterative, highly parallelizable approach to find good tours for very large instances of the Euclidian version of the well-known Traveling Salesma...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Edge Assembly Crossover (EAX) is by far the most successful crossover operator in solving the traveling salesman problem (TSP) with Genetic Algorithms (GAs). Various improvements ...