An exact branch-and-price approach for the medical student scheduling problem
From MaRDI portal
Publication:2668624
Recommendations
Cites work
- A constraint programming based column generation approach to nurse rostering problems
- A constraint-programming-based branch-and-price-and-cut approach for operating room planning and scheduling
- A decomposition-based heuristic procedure for the medical student scheduling problem
- A robust framework for task-related resident scheduling
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Branch-and-price: Column generation for solving huge integer programs
- Complexity results for the basic residency scheduling problem
- Fair optimization of fortnightly physician schedules with flexible shifts
- scientific article; zbMATH DE number 1487984 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- Inequity averse optimization in operational research
- List scheduling in a parallel machine environment with precedence constraints and setup times
- Network flows. Theory, algorithms, and applications.
- On the trade-off between staff-decomposed and activity-decomposed column generation for a staff scheduling problem
- Scheduling medical residents' training at university hospitals
- Scheduling trainees at a hospital department using a branch-and-price approach
- Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
Cited in
(8)- A decomposition-based heuristic procedure for the medical student scheduling problem
- Optimized planning of nursing curricula in dual vocational schools focusing on the German health care system
- Scheduling trainees at a hospital department using a branch-and-price approach
- Modeling and solving the problem of scheduling university exams in terms of new constraints on the conflicts of professors' exams and the concurrence of exams with common questions
- Stable annual scheduling of medical residents using prioritized multiple training schedules to combat operational uncertainty
- Solving the medical student scheduling problem using simulated annealing
- A dedicated branch-price-and-cut algorithm for advance patient planning and surgeon scheduling
- A hybrid primal heuristic for solving an integrated patient case-mix planning problem
This page was built for publication: An exact branch-and-price approach for the medical student scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2668624)