Linear Relaxation: The process of removing the integer constraints from an integer programming problem to solve an easier continuous problem that provides bounds for the original.

A new hierarchy of relaxations is presented that provides a unifying framework for constructing a spectrum of continuous relaxations spanning from the linear programming relaxation to the convex hull ...