Caching Search States in Permutation Problems
From MaRDI portal
Publication:3524209
DOI10.1007/11564751_47zbMath1153.68489OpenAlexW1584243346MaRDI QIDQ3524209
Publication date: 9 September 2008
Published in: Principles and Practice of Constraint Programming - CP 2005 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11564751_47
Related Items (4)
An enhanced branch-and-bound algorithm for the talent scheduling problem ⋮ Exploiting subproblem dominance in constraint programming ⋮ A complete solution to the maximum density still life problem ⋮ A method for detecting symmetries in constraint models and its generalisation
This page was built for publication: Caching Search States in Permutation Problems
