Sciweavers

HEURISTICS
2008
136views more  HEURISTICS 2008»
13 years 10 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
HEURISTICS
2006
148views more  HEURISTICS 2006»
13 years 11 months ago
On global warming: Flow-based soft global constraints
In case a CSP is over-constrained, it is natural to allow some constraints, called soft constraints, to be violated. We propose a generic method to soften global constraints that c...
Willem Jan van Hoeve, Gilles Pesant, Louis-Martin ...
HEURISTICS
2006
120views more  HEURISTICS 2006»
13 years 11 months ago
A study of ACO capabilities for solving the maximum clique problem
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
Christine Solnon, Serge Fenet
HEURISTICS
2006
197views more  HEURISTICS 2006»
13 years 11 months ago
Bucket elimination for multiobjective optimization problems
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE),...
Emma Rollon, Javier Larrosa
HEURISTICS
2006
95views more  HEURISTICS 2006»
13 years 11 months ago
Image registration with iterated local search
Oscar Cordón, Sergio Damas
HEURISTICS
2006
102views more  HEURISTICS 2006»
13 years 11 months ago
A logic of soft constraints based on partially ordered preferences
Representing and reasoning with an agent's preferences is important in many applications of constraints formalisms. Such preferences are often only partially ordered. One clas...
Nic Wilson
HEURISTICS
2006
78views more  HEURISTICS 2006»
13 years 11 months ago
Creating very large scale neighborhoods out of smaller ones by compounding moves
Özlem Ergun, James B. Orlin, Abran Steele-Fel...
HEURISTICS
2006
95views more  HEURISTICS 2006»
13 years 11 months ago
Hard and soft constraints for reasoning about qualitative conditional preferences
Many real life optimization problems are defined in terms of both hard and soft constraints, and qualitative conditional preferences. However, there is as yet no single framework f...
Carmel Domshlak, Steven David Prestwich, Francesca...
HEURISTICS
2006
109views more  HEURISTICS 2006»
13 years 11 months ago
A scatter search algorithm for project scheduling under partially renewable resources
In this paper we develop a heuristic algorithm, based on Scatter Search, for project scheduling problems under partially renewable resources. This new type of resource can be view...
Ramón Alvarez-Valdés, Enric Crespo, ...