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 programming is a crucial branch of mathematical optimisation that focuses on problems where some or all decision variables are constrained to be integers. This field underpins many practical ...