branch-and-bound technique

branch-and-bound technique

[¦branch ən ¦bau̇nd tek′nēk]
(industrial engineering)
A technique in nonlinear programming in which all sets of feasible solutions are divided into subsets, and those having bounds inferior to others are rejected.
References in periodicals archive ?
Applying branch-and-bound technique to route choice set generation, Transportation Research Record 1985: 19-28.
A branch-and-bound technique may be used for implementing the covering global optimization methods (Zilinskas 2008; Paulavicius and Zilinskas 2009) as well as combinatorial optimization algorithms (Zilinskas, A.
The second class contains many simplicial and rectangular branch-and-bound techniques, but, in general, considerably weaker bounds (Galperin 1985; Horst 1988; Pinter 1986a, 1988; Tuy and Horst 1988).