Instructor Fall 2016: Sriram SankaranarayananPrerequisitesCalculus I,II + Algorithms + Linear Algebra.Topics CoveredRoughly, we will cover the following topics (some of them may be skipped depending ...

In this example, the number of integer iterations (INT_ITER=) is zero, which means that the preprocessing has reduced the gap between the relaxed linear problem and the mixed integer program to zero.

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

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

It is shown that the integer linear programming problem with a fixed number of variables is polynomially solvable. The proof depends on methods from geometry of numbers.

The feasibility pump is a well-established primal heuristic for mixed integer programming (MIP) that alternates between solving a linear programming (LP) relaxation of the original problem and ...