Conference item
The Partner Units Problem − A Constraint Programming Case Study
- Abstract:
-
The Partner Units Problem is a challenging combinatorial search problem that originates in the domain of security and surveillance. Technically it consists of partitioning a bipartite graph under side conditions. In this work we describe how constraint programming technology can be leveraged to tackle the problem. We address problem modelling, symmetry breaking and problem-specific search strategies. We introduce the best search strategy known to date as well as a powerful new implied constra...
Expand abstract
Actions
Authors
Bibliographic Details
- Host title:
- Proceedings of the 24th IEEE International Conference on Tools with Artificial Intelligence‚ ICTAI'12
- Publication date:
- 2012-01-01
Item Description
- UUID:
-
uuid:c893bbe3-ee22-4a0f-9cb9-6e10aa518c80
- Local pid:
- cs:6234
- Deposit date:
- 2015-03-31
Terms of use
- Copyright date:
- 2012
Metrics
If you are the owner of this record, you can report an update to it here: Report update to this record