Benders decomposition: Solving binary master problems by enumeration

We develop a variant of Benders decomposition for mixed-integer programming that solves each master problem by explicit enumeration. By storing the master problem’s current objective-function value for each potential solution, computational effort remains essentially constant across iterations. Using both serial and parallel processing, tests against competing methods show computational speedups that exceed two orders of magnitude.