4 search results - page 1 / 1 » Algorithms for subsequence combinatorics |
105
Voted
CP
2006
Springer
15 years 4 months ago
2006
Springer
Many combinatorial problems, such as car sequencing and rostering, feature sequence constraints, restricting the number of occurrences of certain values in every subsequence of a g...
112
Voted
CP
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
105
Voted
CP
1998
Springer
15 years 5 months ago
1998
Springer
A well-studied problem in the electric power industry is that of optimally scheduling preventative maintenance of power generating units within a power plant. We show how these pr...
168
Voted
CP
2004
Springer
15 years 6 months ago
2004
Springer
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...