I am interested in using constraint programming to solve a small timetabling problem. I will first describe the problem informally, then have a look at the type of input and output I expect, and finally try to build a formal model.

The problem is to assign a set ...

more ...I talked about the bin backing problem in a previous post. In this post I will look at some of the lower bounds on the number of bins required to pack a given set of items.

These bounds can be quite helpful while searching for an optimal packing because they ...

more ...The bin packing problem (BPP) is a classic combinatorial optimisation problem. The problem is to pack a given set of items, of differing sizes, into a minimum number of containers of a given capacity. The sum of the items in a container cannot exceed the capacity of the containers. It ...

more ...