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

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

R. C. Daniel, Martyn Jeffreys, Unboundedness in Integer and Discrete Programming L.P. Relaxations, The Journal of the Operational Research Society, Vol. 30, No. 12 ...