Anzeige
Erschienen in:
2017 | OriginalPaper | Buchkapitel
Multi-Objective Branch and Bound
verfasst von : Panos M. Pardalos, Antanas Žilinskas, Julius Žilinskas
Erschienen in: Non-Convex Multi-Objective Optimization
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Branch and boundbranch and bound approaches for optimization problems were developed in the 1960s [114, 121]. The main concept of a branch and bound algorithm is to detect and discard sets of feasible decisions which cannot contain optimal decisions. The search process can be illustrated as a search tree with the root corresponding to the search space and branches corresponding to its subsets. An iteration of the algorithm processes a node in the search tree that represents an unexplored subset of feasible decisions. The iteration has three main components: selection of the subset to be processed, branching corresponding to subdivision of the subset, and bound calculation.