Models and algorithms for a staff scheduling problem
DOI10.1007/s10107-003-0413-7zbMath1160.90471OpenAlexW2082980230MaRDI QIDQ1424308
Alberto Caprara, Paolo Toth, Michele Monaci
Publication date: 11 March 2004
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0413-7
staff schedulingcolumn generationbranch-and-boundheuristic algorithmsinteger linear programmingcomputational resultsmaximum flow
Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Theory of organizations, manpower planning in operations research (90B70)
Related Items