The computational results on problems with up to 2750 variables strongly confirm our hypothesis that a combination of problem preprocessing, cutting planes, and clever branch-and-bound techniques ...

R. C. Daniel, Martyn Jeffreys, Unboundedness in Integer and Discrete Programming L.P. Relaxations, The Journal of the Operational Research Society, Vol. 30, No. 12 ...