1 paper
J. G. Benade, J. N. Hooker
We present a general method for obtaining strong bounds for discrete optimization problems that is based on a concept of branching duality. It can be applied when no useful integer…