Condensing timetables with target date divisible by each instructor's number of class hours

DOI10.1134/S0001434609010064zbMath1173.90408MaRDI QIDQ1033890

Abdulkarim M. Magomedov

Publication date: 10 November 2009

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

multigraphschedulingdynamic programmingHamiltonian cycletimetablinginteger matrixmultisetcondensed timetable

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Application of an algorithm for calculating the maximum density subgraph to the schedule optimization problem

Cites Work

• On the Complexity of Timetable and Multicommodity Flow Problems

This page was built for publication: Condensing timetables with target date divisible by each instructor's number of class hours