Semi-independent Partitioning: A Method for Bounding the Solution to COP's

In this paper we introduce a new method for bounding the solution to constraint optimization problems called semi-independent partitioning. We show that our method is a strict generalization of the mini buckets algorithm [1]. We demonstrate empirically that another specialization of SIP, called greedy SIP, generally produces a better answer than mini buckets in much less time.

• Type: Conference
• Year: 2003
• Where: CP
• Authors: David Larkin
• Keywords: CP 2003, Greedy Sip, Mini Buckets, Programming Languages, Semi-independent Partitioning