3367 search results - page 180 / 674 » Incremental assignment problem |
130
Voted
PATAT
2000
Springer
15 years 7 months ago
2000
Springer
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a given period of time, satisfying a set of different constraints. There are a nu...
153
click to vote
CSR
2007
Springer
15 years 9 months ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
99
Voted
ANOR
2007
15 years 3 months ago
2007
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
119
Voted
CEC
2010
IEEE
15 years 25 days ago
2010
IEEE
Extremal optimisation (EO) is a relatively recent nature-inspired heuristic whose search method is especially suitable to solve combinatorial optimisation problems. To date, most o...
132
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...