Sciweavers

75 search results - page 5 / 15
» A Multilevel Approach to the Travelling Salesman Problem
Sort
View
ANOR
2004
68views more  ANOR 2004»
14 years 9 months ago
Multilevel Refinement for Combinatorial Optimisation Problems
We consider the multilevel paradigm and its potential to aid the solution of combinatorial optimisation problems. The multilevel paradigm is a simple one, which at its most basic ...
Chris Walshaw
AUSSOIS
2001
Springer
15 years 2 months ago
Exact Algorithms for NP-Hard Problems: A Survey
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open prob...
Gerhard J. Woeginger
77
Voted
GECCO
2005
Springer
143views Optimization» more  GECCO 2005»
15 years 3 months ago
Solving geometric TSP with ants
This paper presents an ant-based approach for solving the Traveling Salesman Problem (TSP). Novel concepts of this algorithm that distinguish it from the other heuristics are the ...
Thang Nguyen Bui, Mufit Colpan
HPCC
2005
Springer
15 years 3 months ago
Parallel Branch and Bound Algorithms on Internet Connected Workstations
By the use of the GRIBB software for distributed computing across the Internet, we are investigating the obstacles and the potential for efficient parallelization of Branch and Bou...
Randi Moe, Tor Sørevik
ICANNGA
2007
Springer
133views Algorithms» more  ICANNGA 2007»
15 years 3 months ago
Finding the Optimal Path in 3D Spaces Using EDAs - The Wireless Sensor Networks Scenario
Abstract. In wireless sensor networks where sensors are geographically deployed in 3D spaces, a mobile robot is required to travel to each sensor in order to download the data. The...
Bo Yuan, Maria E. Orlowska, Shazia Wasim Sadiq