Many sequencing and scheduling problems can be formulated as 0-1 integer programs and, in theory, solved using a branch-and-bound approach. In practice, real-world instances of these problems are ...

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 ...