Which of the Following Approaches to Solving Integer Linear Optimization

Multiple Choice

Which of the following approaches to solving integer linear optimization problems tries to identify the convex hull by adding a series of new constraints that do not exclude any feasible integer points?

A) Branch-and bound approach
B) Cutting plane approach
C) Trial-and-error approach
D) Convex hull approach