Cocktail Optimization, an Integer Programming Problem
Summary
The article contrasts a custom branch-and-bound solver with Google OR-Tools' MILP solvers for a cocktail optimization problem, showing that MILP approaches yield rapid, optimal results. It demonstrates a dramatic speedup (milliseconds) and an optimal number of cocktails given 30 ingredients.