Effective integrations of constraint programming, integer programming and local search for two combinatorial optimisation problems
This thesis focuses on the construction of effective and efficient hybrid methods based on the integrations of Constraint Programming (CP), Integer Programming (IP) and local search (LS) to tackle two combinatorial optimisation problems from different application areas: the nurse rostering problems...
| Main Author: | |
|---|---|
| Published: |
University of Nottingham
2012
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.575362 |