This is a preview. Log in through your library . Abstract In this note we use the concept of intersection cut, introduced by Balas for integer programming problems, to develop a cutting-plane ...

We present a method for approximating the solution of mixed integer nonconcave programming problems in bounded variables. We present computational results for 39 test problems which suggest that the ...

Integer linear programming can help find the answer to a variety of real-world problems. Now researchers have found a much faster way to do it. The traveling salesperson problem is one of the oldest ...