New filtering algorithms for combinations of among constraints
From MaRDI portal
(Redirected from Publication:842795)
Recommendations
Cites work
- A \texttt{cost-regular} based hybrid column generation approach
- A dynamic programming approach for consistency and propagation for knapsack constraints
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Combination of Among and Cardinality Constraints
- scientific article; zbMATH DE number 2085269 (Why is no real title available?)
- Introducing global constraints in CHIP
- Principles and Practice of Constraint Programming – CP 2004
- Principles of Constraint Programming
- Revisiting the Sequence Constraint
Cited in
(13)- Constraint programming and operations research
- Weight-based heuristics for constraint satisfaction and combinatorial optimization problems
- An optimal arc consistency algorithm for a particular case of sequence constraint
- Cover combinatorial filters and their minimization problem
- Encodings of the Sequence Constraint
- Revisiting the Sequence Constraint
- Improved filtering for weighted circuit constraints
- Programming Languages and Systems
- Filtering Atmost1 on Pairs of Set Variables
- New filtering for the cumulative constraint in the context of non-overlapping rectangles
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Principles and Practice of Constraint Programming – CP 2004
- Filtering algorithms for the NValue constraint
This page was built for publication: New filtering algorithms for combinations of among constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q842795)