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.
Three researchers from Bristol University are seeking to develop methods for analysing the distribution of integer solutions to polynomial equations. How do you know when a polynomial equation has ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback