Sciweavers

275 search results - page 35 / 55
» The Attractive Traveling Salesman Problem
Sort
View
ADHOC
2005
116views more  ADHOC 2005»
14 years 9 months ago
Power efficient routing trees for ad hoc wireless networks using directional antenna
In ad hoc wireless networks, nodes are typically powered by batteries. Therefore saving energy has become a very important objective, and different algorithms have been proposed t...
Fei Dai, Qing Dai, Jie Wu
MP
2007
97views more  MP 2007»
14 years 9 months ago
On the domino-parity inequalities for the STSP
Abstract One method which has been used very successfully for finding optimal and provably good solutions for large instances of the Symmetric Travelling Salesman Problem (STSP) i...
Sylvia C. Boyd, Sally Cockburn, Danielle Vella
DMGT
2011
94views more  DMGT 2011»
14 years 1 months ago
Closed k-stop distance in graphs
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
Grady Bullington, Linda Eroh, Ralucca Gera, Steven...
JUCS
2010
117views more  JUCS 2010»
14 years 8 months ago
NP-completeness and FPT Results for Rectilinear Covering Problems
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...
Vladimir Estivill-Castro, Apichat Heednacram, Fran...
MP
2006
138views more  MP 2006»
14 years 9 months ago
A new ILP-based refinement heuristic for Vehicle Routing Problems
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to co...
Roberto De Franceschi, Matteo Fischetti, Paolo Tot...