The unbounded knapsack problem: given a knapsack of some capacity and a set of items that have a weight and a value, determine the maximum value of items you can place in your knapsack. The number ...

Lagrangian relaxation, strength of the Lagrangian dual, Lagrangian heuristics. Column generation algorithm, solving symmetric traveling salesman problem using column generation. Greedy and local ...