A separable assignment problem (SAP) is defined by a set of bins and a set of items to pack in each bin; a value, f, for assigning item j to bin i; and a separate packing constraint for each bin—i.e., ...

Vol. 38, No. 5, Special Issue: Proceedings of the 4th International Conference on Mathematical Biology (2008), pp. 1863-1875 (13 pages) Longitudinal continuous proportional data is common in many ...

A team of computer scientists has come up with a dramatically faster algorithm for one of the oldest problems in computer science: maximum flow. The problem asks how much material can flow through a ...