A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems.
Edmund K. BurkeJingpeng LiRong QuPublished in: Eur. J. Oper. Res. (2010)
Keyphrases
- integer programming
- hybrid model
- highly constrained
- cutting plane
- linear programming
- column generation
- constraint programming
- integer program
- constrained problems
- optimization problems
- mathematical programming
- artificial neural networks
- support vector machine svm
- np hard
- lagrangian relaxation
- k nearest neighbor
- np complete
- benchmark problems