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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback