Before revision:  Two skeletal algorithms are defined and instantiated with different separation oracles to yield a sequential convex hull algorithm, a new version of Benson's algorithm with the theoretically best possible iteration count, and the new algorithm.
After revision:  Two skeletal algorithms are defined which focus on the combinatorial part. Using different single-objective optimization problems - called oracle calls - yield different algorithms, such as a sequential convex hull algorithm, a new version of Benson's algorithm with the theoretically best possible iteration count, and the new algorithm.