Spherical cuts for integer programming problems

We introduce a new family of valid inequalities for general linear integer programming problems, based on the distance of the relaxed solution to the closest integral point. We show that these are valid cuts, establish some relations with Balas' intersection cuts, and show that a straightforward cutting plane algorithm derived from either spherical or intersection cuts will in general only converge if a suitable Gomory-type strengthening is put in place.