Set Covering, Partition and Packing

摘要

Set covering problems are known to be solvable by Boolean algebraic methods. This report shows that set partition and set packing problems can be solved by the same algebraic methods because these problems can be converted into covering problems. Many applications are possible including security patrol assignment which is used as an example. (ERA citation 09:027638)