Decomposing Global Grammar Constraints
From MaRDI portal
Recommendations
Cited in
(22)- Combining Benders decomposition and column generation for multi-activity tour scheduling
- A two-stage stochastic programming approach for multi-activity tour scheduling
- Orbital shrinking: theory and applications
- Propagation complete encodings of smooth DNNF theories
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- Grammar constraints
- Formal languages for integer programming modeling of shift scheduling problems
- Time-series constraints: improvements and application in CP and MIP contexts
- Grammar-based integer programming models for multi-activity shift scheduling
- Branch-and-price for personalized multiactivity tour scheduling
- scientific article; zbMATH DE number 4209616 (Why is no real title available?)
- Analyzing Context-Free Grammars Using an Incremental SAT Solver
- GAC Via Unit Propagation
- The Theory of Grammar Constraints
- Global Grammar Constraints
- Reformulating Global Grammar Constraints
- The Polytope of Context-Free Grammar Constraints
- A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem
- MDD propagators with explanation
- The Weighted Cfg Constraint
- The weighted grammar constraint
- A large neighbourhood search approach to the multi-activity shift scheduling problem
This page was built for publication: Decomposing Global Grammar Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3523078)