https://doi.org/10.2307/3009435 • https://www.jstor.org/stable/3009435 Copy URL Commercial branch and bound codes for solving the general mixed integer linear ...
This paper concerns finding a tight lower bound to the travelling-salesman problem, with the hope that all the different branch-and-bound algorithms for this problem can benefit from it. The bound is ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback