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

Document type :
Conference papers
Complete list of metadatas

https://hal.univ-lorraine.fr/hal-01785170
Contributor : Lcoms Ul <>
Submitted on : Friday, May 4, 2018 - 10:46:57 AM
Last modification on : Saturday, May 5, 2018 - 1:19:21 AM

Identifiers

  • HAL Id : hal-01785170, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

26