Sciweavers

944 search results - page 21 / 189
» Heuristic Search for Large Problems With Real Costs
Sort
View
HEURISTICS
1998
103views more  HEURISTICS 1998»
14 years 11 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende
SAINT
2008
IEEE
15 years 6 months ago
Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem
We present a Variable Neighborhood Search approach for a network design problem occurring in real world when the bandwidth of an existing network shall be enhanced. Using two diff...
Markus Leitner, Günther R. Raidl
AIPS
2008
15 years 2 months ago
Unifying the Causal Graph and Additive Heuristics
Many current heuristics for domain-independent planning, such as Bonet and Geffner's additive heuristic and Hoffmann and Nebel's FF heuristic, are based on delete relaxa...
Malte Helmert, Hector Geffner
INFOCOM
1997
IEEE
15 years 4 months ago
Restoration Strategies and Spare Capacity Requirements in Self-Healing ATM Networks
—This paper studies the capacity and flow assignment problem arising in the design of self-healing asynchronous transfer mode (ATM) networks using the virtual path concept. The ...
Yijun Xiong, Lorne Mason
SEAL
1998
Springer
15 years 4 months ago
A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem
Abstract. This paper deals with the problem of nurse rostering in Belgian hospitals. This is a highly constrained real world problem that was (until the results of this research we...
Edmund K. Burke, Patrick De Causmaecker, Greet Van...