Pages that link to "Item:Q632698"
From MaRDI portal
The following pages link to Local search and lower bounds for the patient admission scheduling problem (Q632698):
Displaying 15 items.
- A study of decision support models for online patient-to-room assignment planning (Q284425) (← links)
- The Red-Blue transportation problem (Q296580) (← links)
- Scheduling the hospital-wide flow of elective patients (Q297017) (← links)
- Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays (Q309052) (← links)
- A mixed integer programming approach to the patient admission scheduling problem (Q1631502) (← links)
- Mixed integer programming based heuristics for the patient admission scheduling problem (Q1652186) (← links)
- Compatibility of short and long term objectives for dynamic patient admission scheduling (Q1725603) (← links)
- An efficient matheuristic for offline patient-to-bed assignment problems (Q1754343) (← links)
- On the performance of scatter search for post-enrolment course timetabling problems (Q2015784) (← links)
- A stochastic model for the patient-bed assignment problem with random arrivals and departures (Q2171327) (← links)
- A column generation approach for solving the patient admission scheduling problem (Q2256225) (← links)
- Operating room planning and surgical case scheduling: a review of literature (Q2424648) (← links)
- Admission control of hospitalization with patient gender by using Markov decision process (Q6056094) (← links)
- Patient admission scheduling problems with uncertain length of stay: optimization models and an efficient matheuristic approach (Q6060690) (← links)
- Structural insights about avoiding transfers in the patient-to-room assignment problem (Q6202948) (← links)
