Principles and Practice of Constraint Programming – CP 2003
DOI10.1007/B13743zbMATH Open1273.68075OpenAlexW2497660909MaRDI QIDQ5897205FDOQ5897205
Authors: Alan M. Frisch, Chris Jefferson, Ian Miguel 
Publication date: 2 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13743
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)
Cited In (19)
- Six Ways of Integrating Symmetries within Non-overlapping Constraints
- Minimal ordering constraints for some families of variable symmetries
- Symmetry breaking constraints for value symmetries in constraint satisfaction
- On matrices, automata, and double counting in constraint programming
- Symmetries of symmetry breaking constraints
- Constraints for symmetry breaking in graph representation
- Combining Symmetry Breaking and Global Constraints
- Breaking symmetries in graph search with canonizing sets
- Solving necklace constraint problems
- Towards breaking more composition symmetries in partial symmetry breaking
- \textsc{Conjure}: automatic generation of constraint models from problem specifications
- Symmetry breaking using stabilizers
- Automated streamliner portfolios for constraint satisfaction problems
- Variable symmetry breaking in numerical constraint problems
- Automatically improving constraint models in Savile Row
- Dynamic Lex Constraints
- Dominance breaking constraints
- Filtering algorithms for the multiset ordering constraint
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
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)
