1102 search results - page 31 / 221 » Dynamic Constraint Models for Planning and Scheduling Proble... |
CORR
2007
Springer
15 years 13 days ago
2007
Springer
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the s...
107
click to vote
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We define and study two versions of the bipartite matching problem in the framework of two-stage stochastic optimization with recourse. In one version the uncertainty is...
ATAL
2009
Springer
15 years 7 months ago
2009
Springer
Knockout tournaments constitute a common format of sporting events, and also model a specific type of election scheme (namely, sequential pairwise elimination election). In such ...
127
click to vote
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
In this paper, a novel approach for designing chromosome has been proposed to improve the effectiveness, which called multistage operation-based genetic algorithm (moGA). The obje...
92
Voted
CPAIOR
2009
Springer
15 years 7 months ago
2009
Springer
This paper introduces a global constraint encapsulating a regular constraint together with several cumulative costs. It is motivated in the context of personnel scheduling problems...