Encyclopedia

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.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
References in periodicals archive
In this case we use a branch-and-bound technique based on the idea developed in [Lampert, 2008], as in Figure 4.
Object localization using Kinect
Applying branch-and-bound technique to route choice set generation, Transportation Research Record 1985: 19-28.
Meta-analysis of choice set generation effects on route choice model estimates and predictions
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.
Global optimization using the branch-and-bound algorithm with a combination of Lipschitz bounds over simplices/Globalusis optimizavimas saku ir reziu algoritmu su lipsico reziu junginiu simplekse
Copyright © 2003-2025 Farlex, Inc Disclaimer
All content on this website, including dictionary, thesaurus, literature, geography, and other reference data is for informational purposes only. This information should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional.