17 search results - page 1 / 4 » Formal languages for integer programming modeling of shift s... |
91
Voted
CONSTRAINTS
2011
14 years 7 months ago
2011
109
Voted
CPAIOR
2009
Springer
15 years 7 months ago
2009
Springer
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...
100
Voted
HEURISTICS
2010
14 years 7 months ago
2010
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...
124
Voted
INFORMS
1998
15 years 5 days ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
113
Voted
VLSID
2002
IEEE
16 years 27 days ago
2002
IEEE
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...