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 new dual-Petrov-Galerkin method is proposed, analyzed, and implemented for third and higher odd-order equations using a spectral ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback