A multi-objective approach to nurse scheduling with both hard and soft constraints

1996 ◽  
Vol 30 (3) ◽  
pp. 183-193 ◽  
Author(s):  
Ilham Berrada ◽  
Jacques A. Ferland ◽  
Philippe Michelon
2013 ◽  
Author(s):  
Arnaud Gelas

Deforming a 3D surface mesh while preserving its local detail is useful for editing anatomical atlases or for mesh based segmentation. This contribution introduces new classes for performing hard and soft constraints deformation in a flexible design which allows user to switch easily in between Laplacian discretization operators, area weighing and solvers. The usage of these new classes is demonstrated on a sphere.


Author(s):  
Chu Min Li ◽  
Felip Manyà

MaxSAT solving is becoming a competitive generic approach for solving combinatorial optimization problems, partly due to the development of new solving techniques that have been recently incorporated into modern MaxSAT solvers, and to the challenge problems posed at the MaxSAT Evaluations. In this chapter we present the most relevant results on both approximate and exact MaxSAT solving, and survey in more detail the techniques that have proven to be useful in branch and bound MaxSAT and Weighted MaxSAT solvers. Among such techniques, we pay special attention to the definition of good quality lower bounds, powerful inference rules, clever variable selection heuristics and suitable data structures. Moreover, we discuss the advantages of dealing with hard and soft constraints in the Partial MaxSAT formalims, and present a summary of the MaxSAT Evaluations that have been organized so far as affiliated events of the International Conference on Theory and Applications of Satisfiability Testing.


Sign in / Sign up

Export Citation Format

Share Document