This paper presents the results of experimentation on the development of an efficient branch-and-bound algorithm for the solution of zero-one linear mixed integer programming problems. An implicit ...
This is a preview. Log in through your library . Abstract In this paper, a branch and bound algorithm is presented for solving network design problems (NDP). Route selection for the NDP is based on a ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback