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$.$

Convex hull approach

b$.$

Branch$-$and bound approach

c$.$

Trial$-$and$-$error approach

d$.$

Cutting plane approach