Sciweavers

16404 search results - page 522 / 3281
» A set coverage problem
Sort
View
COR
2006
120views more  COR 2006»
15 years 7 months ago
A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem
Home health care, i.e. visiting and nursing patients in their homes, is a growing sector in the medical service business. From a staff rostering point of view, the problem is to f...
Stefan Bertels, Torsten Fahle
EOR
2006
44views more  EOR 2006»
15 years 7 months ago
The multiple-job repair kit problem
The repair kit problem is that of finding the optimal set of parts in the kit of a repairman. An important aspect of this problem, in many real-life situations, is that several jo...
Ruud H. Teunter
IPL
2008
114views more  IPL 2008»
15 years 6 months ago
The online Prize-Collecting Traveling Salesman Problem
We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to v...
Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura
CORR
2007
Springer
98views Education» more  CORR 2007»
15 years 6 months ago
The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions
Abstract. Holzer and Holzer [7] proved that the TantrixTM rotation puzzle problem with four colors is NP-complete, and they showed that the infinite variant of this problem is und...
Dorothea Baumeister, Jörg Rothe
APIN
2005
92views more  APIN 2005»
15 years 6 months ago
A Hybrid Neural-Genetic Algorithm for the Frequency Assignment Problem in Satellite Communications
A hybrid Neural-Genetic algorithm (NG) is presented for the frequency assignment problem in satellite communications (FAPSC). The goal of this problem is minimizing the cochannel i...
Sancho Salcedo-Sanz, Carlos Bousoño-Calz&oa...