CPAIOR
15 years 2 months ago
2005 Springer 
A cardinality constraint imposes that each value of a set V must be taken a certain number of times by a set of variables X, whereas an among constraint imposes that a certain numb...
CPAIOR
15 years 2 months ago
2005 Springer 
Abstract. This paper introduces a problem called the temporal knapsack problem, presents several algorithms for solving it, and compares their performance. The temporal knapsack pr...
CPAIOR
15 years 2 months ago
2005 Springer 
The effects of combining search and modelling techniques can be complex and unpredictable, so guidelines are very important for the design and development of effective and robust s...
CPAIOR
15 years 2 months ago
2005 Springer
Abstract. The NValue constraint counts the number of different values assigned to a vector of variables. Propagating generalized arc consistency on this constraint is NP-hard. We ...
CPAIOR
15 years 2 months ago
2005 Springer 
Abstract. Recently, new cost-based filtering algorithms for shorter-path constraints have been developed. However, so far only the theoretical properties of shorter-path constrain...
|
Operations Research