Principles and Practice of Constraint Programming – CP 2003
From MaRDI portal
(Redirected from Publication:5897205)
Principles and Practice of Constraint Programming – CP 2003 (scientific article; zbMATH DE number 5676656)
Principles and Practice of Constraint Programming – CP 2003 (scientific article; zbMATH DE number 5676656)
Recommendations
Cited in
(19)- Towards breaking more composition symmetries in partial symmetry breaking
- Automatically improving constraint models in Savile Row
- \textsc{Conjure}: automatic generation of constraint models from problem specifications
- Constraints for symmetry breaking in graph representation
- On matrices, automata, and double counting in constraint programming
- Dominance breaking constraints
- Breaking symmetries in graph search with canonizing sets
- Symmetries of symmetry breaking constraints
- Solving necklace constraint problems
- Dynamic Lex Constraints
- Six Ways of Integrating Symmetries within Non-overlapping Constraints
- Combining Symmetry Breaking and Global Constraints
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Symmetry breaking using stabilizers
- Automated streamliner portfolios for constraint satisfaction problems
- Filtering algorithms for the multiset ordering constraint
- Symmetry breaking constraints for value symmetries in constraint satisfaction
- Variable symmetry breaking in numerical constraint problems
- Minimal ordering constraints for some families of variable symmetries
This page was built for publication: Principles and Practice of Constraint Programming – CP 2003
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897205)