Letter to the Editor—A Note on the Branch-and-Bound Principle
From MaRDI portal
Publication:5580091
DOI10.1287/OPRE.16.2.442zbMath0186.24901OpenAlexW2078358924WikidataQ100604529 ScholiaQ100604529MaRDI QIDQ5580091
Publication date: 1968
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.16.2.442
Related Items (11)
Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben ⋮ An efficient bound-and-stopped algorithm for integer linear programs on the objective function hyperplane ⋮ Dominance rules in combinatorial optimization problems ⋮ An effective structured approach to finding optimal partitions of networks ⋮ Branch-and-bound as a higher-order function ⋮ Discrete solutions to engineering design problems ⋮ Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint) ⋮ Theoretical comparisons of search strategies in branch-and-bound algorithms ⋮ A continuous approach to nonlinear integer programming ⋮ Edmonds polytopes and a hierarchy of combinatorial problems ⋮ A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures
This page was built for publication: Letter to the Editor—A Note on the Branch-and-Bound Principle
