1984 search results - page 48 / 397 » The colourful feasibility problem |
IJCAI
2003
13 years 11 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
OL
2010
13 years 8 months ago
2010
In this note we consider the properties of the Hamming distance in combinatorial optimization problems on hypergraph matchings, also known as multidimensional assignment problems....
JORS
2010
13 years 4 months ago
2010
The facility layout problem is concerned with finding the most efficient arrangement of a given number of departments with unequal area requirements within a facility. The facilit...
AISB
1995
Springer
14 years 1 months ago
1995
Springer
This paper discusses a series of recombination operators for the timetabling problem. These operators act upon a direct representation of the timetable and maintain the property of...
ENDM
2010
13 years 10 months ago
2010
We study an extension of the precedence constrained knapsack problem where the knapsack can be filled in multiple periods. This problem is known in the mining industry as the open...