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

In this note we use the concept of intersection cut, introduced by Balas for integer programming problems, to develop a cutting-plane algorithm for solving integer interval linear programming problems ...

Roughly, we will cover the following topics (some of them may be skipped depending on the time available). Linear Programming: Basics, Simplex Algorithm, and Duality. Applications of Linear ...

Mixed-integer programs (MIPs) involving logical implications modeled through big-M coefficients are notoriously among the hardest to solve. In this paper, we propose and analyze computationally an ...