Details about remote learning Introduction to discrete optimization with three examples: minimum surface area of a can, knapsack problem, travel salesman problem. Three methods: brute force, relaxation, greedy
No download links available.
