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

These include integer linear programming (Land-Doig and Balas methods), nonlinear programming (minimization of nonconvex objective functions), the traveling-salesman problem (Eastman and Little, et.

This course continues our data structures and algorithms specialization by focussing on the use of linear and integer programming formulations for solving algorithmic problems that seek optimal ...