Integer Linear Programming
Input description: A linear functional cx, a set of linear constraints Ax >= b, a set of non-negative variables x that can take on only integer values, say 0 or 1, a value V.
Problem description: Are there 0/1 integer values for the variables x satisfying the linear constraints such that the linear functional cx <= V.
Optimization version: minimize V.
Example: absolutely everything