The branch-and-bound method with the revised dual simplex for bounded variables is very effective in solving relatively large-size integer linear programming problems. This paper, based on the general ...

This is a preview. Log in through your library . Abstract A method is given for maximizing a linear function subject to a quadratic and a number of linear constraints. The method differs from general ...