Pages that link to "Item:Q2030502"
From MaRDI portal
The following pages link to Solving integrated operating room planning and scheduling: logic-based Benders decomposition versus branch-price-and-cut (Q2030502):
Displaying 10 items.
- Sequencing surgical cases in a day-care environment: an exact branch-and-price approach (Q1010278) (← links)
- Recursive logic-based Benders' decomposition for multi-mode outpatient scheduling (Q1751262) (← links)
- Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling (Q1752822) (← links)
- The multiphase course timetabling problem (Q2116932) (← links)
- A constraint-programming-based branch-and-price-and-cut approach for operating room planning and scheduling (Q2830948) (← links)
- Logic-Based Benders Decomposition and Binary Decision Diagram Based Approaches for Stochastic Distributed Operating Room Scheduling (Q5084615) (← links)
- Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut (Q6096622) (← links)
- A branch-and-price-and-cut algorithm for operating room scheduling under human resource constraints (Q6164341) (← links)
- Stochastic weekly operating room planning with an exponential number of scenarios (Q6179190) (← links)
- A hybrid heuristic approach to master surgery scheduling with downstream resource constraints and dividable operating room blocks (Q6179192) (← links)
