Sciweavers

275 search results - page 24 / 55
» The Attractive Traveling Salesman Problem
Sort
View
ENDM
2010
136views more  ENDM 2010»
14 years 9 months ago
Approximating the asymmetric profitable tour
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...
Viet Hung Nguyen, Thi Thu Thuy Nguyen
IPPS
2002
IEEE
15 years 2 months ago
A New Estimation Method for Distributed Java Object Activity
We introduce a new method to estimate the Java object activity in a distributed context of irregular applications. This method uses an observation mechanism which is itself a part...
Amer Bouchi, Richard Olejnik, Bernard Toursel
APNOMS
2006
Springer
15 years 1 months ago
GISness System for Fast TSP Solving and Supporting Decision Making
This paper shows that geographic information system can successfully solve TSP (travelling salesman problem). It has been done using a module of the designed and implemented by aut...
Iwona Pozniak-Koszalka, Ireneusz Kulaga, Leszek Ko...
APPROX
2008
Springer
124views Algorithms» more  APPROX 2008»
14 years 11 months ago
Deterministic 7/8-Approximation for the Metric Maximum TSP
We present the first 7/8-approximation algorithm for the maximum traveling salesman problem with triangle inequality. Our algorithm is deterministic. This improves over both the r...
Lukasz Kowalik, Marcin Mucha
GECCO
2010
Springer
213views Optimization» more  GECCO 2010»
14 years 10 months ago
Consultant-guided search algorithms for the quadratic assignment problem
Abstract. Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based ...
Serban Iordache