Partner Units Revisited

摘要: The Partner Units Problem is a challenging combinatorial search problem that has applications in the domains of security and surveillance. In this work we look at problem-specific implied constraints, search strategies and symmetry breaking approaches. We discuss the modelling and solving techniques offered by SAT solvers and answer set programming on the one hand, and constraint solvers on the other hand.