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 ...
We describe a method for generating cuts for mixed-integer 0/1 programs. These cuts are designed to tighten an integer program prior to applying linear programming based branch and bound algorithms.
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback