This is a preview. Log in through your library . Abstract We let D be a local (noetherian) one-dimensional unibranched domain, K its quotient field, m its maximal ideal, D' its integral closure, and m ...

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.