Pages that link to "Item:Q857889"
From MaRDI portal
The following pages link to A \texttt{cost-regular} based hybrid column generation approach (Q857889):
Displaying 33 items.
- A mixed integer programming approach to multi-skilled workforce scheduling (Q283273) (← links)
- Retail store scheduling for profit (Q297364) (← links)
- On an exact method for the constrained shortest path problem (Q339592) (← links)
- A constraint programming based column generation approach to nurse rostering problems (Q339698) (← links)
- A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem (Q398914) (← links)
- The extended global cardinality constraint: an empirical survey (Q543616) (← links)
- The weighted grammar constraint (Q545550) (← links)
- A shortest path-based approach to the multileaf collimator sequencing problem (Q765342) (← links)
- New filtering algorithms for combinations of among constraints (Q842795) (← links)
- A large neighbourhood search approach to the multi-activity shift scheduling problem (Q972651) (← links)
- Enhancing CP-based column generation for integer programs (Q1041402) (← links)
- Constraint programming and operations research (Q1616390) (← 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)
- Deriving generic bounds for time-series constraints based on regular expressions characteristics (Q1706597) (← links)
- A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem (Q1991205) (← links)
- The item dependent stockingcost constraint (Q2009188) (← links)
- MDDs are efficient modeling tools: an application to some statistical constraints (Q2011571) (← links)
- When bounds consistency implies domain consistency for regular counting constraints (Q2079264) (← links)
- Grammar constraints (Q2267808) (← links)
- Compiling CP subproblems to MDDs and d-DNNFs (Q2331104) (← links)
- Solving multi-activity multi-day shift scheduling problems with a hybrid heuristic (Q2341394) (← links)
- An optimal arc consistency algorithm for a particular case of sequence constraint (Q2342590) (← links)
- Three generalizations of the FOCUS constraint (Q2398512) (← links)
- Formal languages for integer programming modeling of shift scheduling problems (Q2430360) (← links)
- A global constraint for total weighted completion time for unary resources (Q2430362) (← links)
- New approaches to nurse rostering benchmark instances (Q2514811) (← links)
- Achieving Domain Consistency and Counting Solutions for Dispersion Constraints (Q2802248) (← links)
- Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation (Q2815431) (← links)
- Grammar-Based Integer Programming Models for Multi-Activity Shift Scheduling (Q2883642) (← links)
- Branch-and-Price for Personalized Multiactivity Tour Scheduling (Q3186663) (← links)
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation (Q5131729) (← links)
- Fairness over time in dynamic resource allocation with an application in healthcare (Q6120930) (← links)