242 search results - page 36 / 49 » Approximation Algorithms for Multi-Criteria Traveling Salesm... |
CONSTRAINTS
2002
14 years 9 months ago
2002
A global cardinality constraint (gcc) is specified in terms of a set of variables X = {x1, ..., xp} which take their values in a subset of V = {v1, ..., vd}. It constrains the numb...
IAT
2008
IEEE
15 years 4 months ago
2008
IEEE
The discrete particle swarm optimization (DPSO) is a kind of particle swarm optimization (PSO) algorithm to find optimal solutions for discrete problems. This paper proposes an i...
LION
2009
Springer
15 years 4 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...
SIAMCOMP
2008
14 years 9 months ago
2008
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
SSD
2007
Springer
15 years 3 months ago
2007
Springer
An uncertain geo-spatial dataset is a collection of geo-spatial objects that do not represent accurately real-world entities. Each object has a confidence value indicating how lik...