Pages that link to "Item:Q3523078"
From MaRDI portal
The following pages link to Decomposing Global Grammar Constraints (Q3523078):
Displaying 16 items.
- A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem (Q398914) (← links)
- MDD propagators with explanation (Q429805) (← links)
- The weighted grammar constraint (Q545550) (← links)
- A large neighbourhood search approach to the multi-activity shift scheduling problem (Q972651) (← 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)
- Propagation complete encodings of smooth DNNF theories (Q2079276) (← links)
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions (Q2238714) (← links)
- Grammar constraints (Q2267808) (← links)
- Formal languages for integer programming modeling of shift scheduling problems (Q2430360) (← links)
- Grammar-Based Integer Programming Models for Multi-Activity Shift Scheduling (Q2883642) (← links)
- Branch-and-Price for Personalized Multiactivity Tour Scheduling (Q3186663) (← links)
- Analyzing Context-Free Grammars Using an Incremental SAT Solver (Q3519518) (← links)
- GAC Via Unit Propagation (Q3523055) (← links)
- The Weighted Cfg Constraint (Q5387640) (← links)