Formulate linear and integer programming problems for solving commonly encountered optimization problems. Understand how approximation algorithms compute solutions that are guaranteed to be within ...

CS 336 or Permission of Instructor Description This is an advanced undergraduate course on algorithms. This course examines such topics as greedy algorithms, dynamic programming, graph algorithms, ...

This paper presents the results of experimentation on the development of an efficient branch-and-bound algorithm for the solution of zero-one linear mixed integer programming problems. An implicit ...

Mauricio G. C. Resende, K. G. Ramakrishnan, Zvi Drezner, Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear ...