A discrete optimization problem can be expressed as a tuple (S, f). The set is a finite or countably infinite set of all solutions that satisfy specified constraints
A discrete optimization problem can be expressed as a tuple (S, f). The set is a finite or countably infinite set of all solutions that satisfy specified constraints.