13 search results - page 2 / 3 » Hybrid Metaheuristic for the Prize Collecting Travelling Sal... |
ENDM
2010
13 years 8 months ago
2010
Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...
HM
2009
Springer
14 years 1 months ago
2009
Springer
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
COMPSAC
2004
IEEE
14 years 9 days ago
2004
IEEE
While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to speci...
SODA
2001
ACM
13 years 10 months ago
2001
ACM
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
4OR
2004
13 years 8 months ago
2004
This paper presents upper bounds for the Satellite Revenue Selection and Scheduling problem (SRSS). A compact model of this generalized Prize Collecting Traveling Salesman Problem ...