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

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.

In this paper, we give a finite disjunctive programming procedure to obtain the convex hull of general mixed-integer linear programs (MILP) with bounded integer variables. We propose a finitely ...

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