implicit enumeration

implicit enumeration

[im′plis·ət i‚nü·mə′rā·shən]
(mathematics)
A method of solving integer programming problems, in which tests that follow conceptually from using implied upper and lower bounds on variables are used to eliminate all but a tiny fraction of the possible values, with implicit treatment of all other possibilities.