I was wondering if you would be interested in a PR for some background information on discrete optimisation (of which LP and MIP are branches), I've done a couple of excellent Coursera courses on the subject, as well as related software (using local search) that introduces common optimisation problems like knapsack, graph colouring, tsp, etc.
I was wondering if you would be interested in a PR for some background information on discrete optimisation (of which LP and MIP are branches), I've done a couple of excellent Coursera courses on the subject, as well as related software (using local search) that introduces common optimisation problems like knapsack, graph colouring, tsp, etc.