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.
References in periodicals archive ?
Conventional methods for determining assignments of tasks to processors or events to time periods include exhaustive enumeration, implicit enumeration (branch and bound), constructive assignment (in which partial assignments are completed to yield feasible assignments) and iterative improvement (in which complete feasible assignments are repeatedly altered in ways that improve the objective function).
Implicit enumeration techniques may be designed to yield effective allocations, but they also may degenerate in the worst case into an exhaustive search.