C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
An Efficient Translation Scheme for Representing Nurse Rostering Problems as Satisfiability Problems.
Stefaan Haspeslagh
Tommy Messelis
Greet Vanden Berghe
Patrick De Causmaecker
Published in:
ICAART (2) (2013)
Keyphrases
</>
satisfiability problem
np complete
stochastic local search algorithms
search procedures
solving hard
finite domain
decision problems
reinforcement learning
constraint programming
temporal logic
phase transition
practical problems
sat problem