Sciweavers

2108 search results - page 66 / 422
» Constrained Heuristic Search
Sort
View
EOR
2008
107views more  EOR 2008»
15 years 1 months ago
Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
Alysson M. Costa, Jean-François Cordeau, Gi...
CP
2008
Springer
15 years 3 months ago
Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT
One way to design a local search algorithm that is effective on many types of instances is allowing this algorithm to switch among heuristics. In this paper, we refer to the way in...
Wanxia Wei, Chu Min Li, Harry Zhang
FLAIRS
2007
15 years 4 months ago
Case-Based Recommendation of Node Ordering in Planning
Currently, among the fastest approaches to AI task planning we find many forward-chaining heuristic planners, as FF. Most of their good performance comes from the use of domain-i...
Tomás de la Rosa, Angel García Olaya...
HEURISTICS
2002
81views more  HEURISTICS 2002»
15 years 1 months ago
Heuristics for the Phylogeny Problem
In view of the strong increasing number of phylogeny problems and instances, the assessment of the respective optimization algorithms has become harder too. This paper contributes ...
Alexandre A. Andreatta, Celso C. Ribeiro
INFORMATICALT
2000
113views more  INFORMATICALT 2000»
15 years 1 months ago
An Intensive Search Algorithm for the Quadratic Assignment Problem
Many heuristics, such as simulated annealing, genetic algorithms, greedy randomized adaptive search procedures are stochastic. In this paper, we propose a deterministic heuristic a...
Alfonsas Misevicius