Abstract

Many combinatorial riddles may be translated into integer programming problems. Here the well-known puzzle of the Soma cube is formulated as a set partitioning problem in two different ways. This leads to fast algorithms for the enumeration of all solutions.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call