Complexity and Heuristics for Multi Bipartite Complete Matching Vertex Interdiction Problem: Application to Robust Nurse Assignment - Université de Lorraine Access content directly
Conference Papers Year : 2016

Complexity and Heuristics for Multi Bipartite Complete Matching Vertex Interdiction Problem: Application to Robust Nurse Assignment

No file

Dates and versions

hal-01785170 , version 1 (04-05-2018)

Identifiers

  • HAL Id : hal-01785170 , version 1

Cite

Pierre Laroche, Franc Marchetti, Sébastien Martin, Zsuzsanna Roka, Mengli Zheng. Complexity and Heuristics for Multi Bipartite Complete Matching Vertex Interdiction Problem: Application to Robust Nurse Assignment. 45th International Conference on Computers & Industrial Engineering 2015 (CIE45), Oct 2015, Metz, France. pp.1294-1301. ⟨hal-01785170⟩
28 View
0 Download

Share

Gmail Facebook X LinkedIn More