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

Dropping the "complicating" constraints in a mixed-integer linear program often yields a "special structure subproblem" that can be reformulated using a different set of decision variables. Once the ...