Pages that link to "Item:Q1991205"
From MaRDI portal
The following pages link to A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem (Q1991205):
Displaying 7 items.
- A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem (Q398914) (← links)
- A large neighbourhood search approach to the multi-activity shift scheduling problem (Q972651) (← links)
- An implicit model for multi-activity shift scheduling problems (Q1617280) (← links)
- A matheuristic algorithm for stochastic home health care planning (Q2028758) (← links)
- Learning to reduce state-expanded networks for multi-activity shift scheduling (Q2117239) (← links)
- Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems (Q2669540) (← links)
- Block-based state-expanded network models for multi-activity shift scheduling (Q6620465) (← links)