Pages that link to "Item:Q3898330"
From MaRDI portal
The following pages link to Cyclic Scheduling via Integer Programs with Circular Ones (Q3898330):
Displayed 11 items.
- A heuristic procedure for the crew rostering problem (Q1194743) (← links)
- Extensions of coloring models for scheduling purposes (Q1268282) (← links)
- Scheduling staff using mixed integer programming (Q1278723) (← links)
- Cyclic and non-cyclic scheduling of 12h shift nurses by network programming (Q1291691) (← links)
- A rounding algorithm for integer programs (Q1327212) (← links)
- Balancing problems in acyclic networks (Q1327220) (← links)
- A comparative evaluation of modeling approaches to the labor shift scheduling problem (Q1580984) (← links)
- An extension of a theorem of Fulkerson and Gross (Q1816927) (← links)
- Parametric formulation of the general integer linear programming problem (Q1919968) (← links)
- The column-circular, subsets-selection problem: Complexity and solutions (Q1974273) (← links)
- A class of manpower scheduling problems (Q4000927) (← links)