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., ...

This is a preview. Log in through your library . Abstract We apply a potential reduction algorithm to solve the general linear complementarity problem (GLCP) minimize ...

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 ...

*Note: This course description is only applicable for the Computer Science Post-Baccalaureate program. Additionally, students must always refer to course syllabus for the most up to date information.