Principles and Practice of Constraint Programming – CP 2003
From MaRDI portal
Publication:5897205
DOI10.1007/b13743zbMath1273.68075OpenAlexW2497660909MaRDI QIDQ5897205
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
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (9)
Filtering algorithms for the multiset ordering constraint ⋮ Symmetry breaking constraints for value symmetries in constraint satisfaction ⋮ \textsc{Conjure}: automatic generation of constraint models from problem specifications ⋮ Breaking symmetries in graph search with canonizing sets ⋮ Towards breaking more composition symmetries in partial symmetry breaking ⋮ Automatically improving constraint models in Savile Row ⋮ Automated streamliner portfolios for constraint satisfaction problems ⋮ Constraints for symmetry breaking in graph representation ⋮ On matrices, automata, and double counting in constraint programming
This page was built for publication: Principles and Practice of Constraint Programming – CP 2003