Bipartite Complete Matching Vertex Interdiction Problem: Application to Robust Nurse Assignment - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Bipartite Complete Matching Vertex Interdiction Problem: Application to Robust Nurse Assignment

Résumé

In this paper, we consider the Robust Nurse Assignment Problem. This consists in finding the maximum number of absences of qualified nurses still permitting an optimal treatment of patients, leading us to the notion of critical jobs. We introduce the Bipartite Complete Matching Vertex Interdiction Problem as the graph formulation of this problem. We show that it can be solved in polynomial time thanks to the integer polytope of an associated sub-problem. Then, we study the polytope associated with the Bipartite Complete Matching Vertex Interdiction Problem. We also extend the well-known Hall theorem to this problem.
Fichier non déposé

Dates et versions

hal-01267623 , version 1 (04-02-2016)

Identifiants

  • HAL Id : hal-01267623 , version 1

Citer

Pierre Laroche, Franc Marchetti, Sebastien Martin, Zsuzsanna Roka. Bipartite Complete Matching Vertex Interdiction Problem: Application to Robust Nurse Assignment. 2014 INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT), Nov 2014, Metz, France. pp.182-187. ⟨hal-01267623⟩
35 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More