Cutting planes are a method used in integer programming to refine the feasible region by iteratively adding linear inequalities. This technique helps in optimizing solutions by eliminating non-integral points without excluding any of the integer feasible solutions from the set.