Recursive branch and bound
From MaRDI portal
In the classical branch and bound approach for solving integer programming problems the original problem is replaced by a series of relaxations, i.e. problems of another class which are easier to solve and the optimal values of which bound the optimal value of the problem under consideration. Here the author introduces a variant - the recursive branch and bound - where the substitute problem for building the bound belongs to the same class like the problem being solved but the optimal value of which has already been calculated in an earlier step.
Recommendations
Cites work
- An Algorithm for the Traveling Salesman Problem
- Branch-and-Bound Methods: General Formulation and Properties
- Discrete Programming by the Filter Method
- Ein erweiterungsprinzip als konzeption zur lösung kombinatorischer optimierungsprobleme
- scientific article; zbMATH DE number 3156817 (Why is no real title available?)
Cited in
(5)- Branch-and-bound as a higher-order function
- scientific article; zbMATH DE number 3861209 (Why is no real title available?)
- Determining initial bound by ``ray-method in branch and bound procedure
- Recursive properties of branching and BGG resolution
- scientific article; zbMATH DE number 3895067 (Why is no real title available?)
This page was built for publication: Recursive branch and bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3693268)