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

This paper elaborates a method of attack on traveling-salesman problems, proposed by the authors in an earlier paper, in which linear programming is used to reduce the combinatorial magnitude of such ...