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, a cornerstone of combinatorial optimisation, focuses on the selection of discrete decision variables to solve complex real‐world problems such as scheduling, network design and ...
This is a preview. Log in through your library . Abstract A logarithmic-exponential dual formulation is proposed in this paper for bounded integer programming problems. This new dual formulation ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback