## Integer linear programming #

ILP involves the study of linear programs where variables are additionally constrained to be integers. These problems are NP-complete in general, but some special, much-studied cases have fast algorithms (e.g. min-cost flow).

### Links and resources #

- Multi-commodity flow, a generalisation of the maximum flow problem.
- Docplex, a package developed by IBM to solve ILPs and other classes of discrete optimisation problems.
- A nice new theoretical result on runtime bounds for ILPs.