Pages that link to "Item:Q2430360"

The following pages link to Formal languages for integer programming modeling of shift scheduling problems (Q2430360):

Displaying 19 items.

• Retail store scheduling for profit (Q297364) (← links)
• On an exact method for the constrained shortest path problem (Q339592) (← links)
• A two-phase mathematical-programming heuristic for flexible assignment of activities and tasks to work shifts (Q398875) (← links)
• A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem (Q398914) (← links)
• An implicit model for multi-activity shift scheduling problems (Q1617280) (← links)
• Combining Benders decomposition and column generation for multi-activity tour scheduling (Q1652589) (← links)
• A two-stage stochastic programming approach for multi-activity tour scheduling (Q1683088) (← links)
• Orbital shrinking: theory and applications (Q1786877) (← links)
• A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem (Q1991205) (← links)
• Learning to reduce state-expanded networks for multi-activity shift scheduling (Q2117239) (← links)
• A MinCumulative resource constraint (Q2170208) (← links)
• A two-stage solution approach for personalized multi-department multi-day shift scheduling (Q2327641) (← links)
• Solving multi-activity multi-day shift scheduling problems with a hybrid heuristic (Q2341394) (← links)
• Modeling and solving a real-life multi-skill shift design problem (Q2398430) (← links)
• New approaches to nurse rostering benchmark instances (Q2514811) (← links)
• Branch-and-Price for Personalized Multiactivity Tour Scheduling (Q3186663) (← links)
• The Weighted Cfg Constraint (Q5387640) (← links)
• Assigning Team Tasks and Multiple Activities to Fixed Work Shifts (Q6160387) (← links)
• Block-based state-expanded network models for multi-activity shift scheduling (Q6620465) (← links)