A new procedure for mixed integer programming is presented. It is applicable where the integer variables must be either zero or one, and where the integer variables are divided into sets such that the ...
This is a preview. Log in through your library . Abstract A computational procedure based on the results of Barankin and Dorfman [1], for minimising a convex quadratic function subject to linear ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback