| 释义 |
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. |