Branch-and-bound methods

MaRDI QIDQ3081834zbMATH OpenFDO

Authors Irène Charon, Olivier Hudry

Publication date 9 March 2011

zbMATH Keywords

exact methodsexhaustive enumeration

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• About branch and bound method
• scientific article; zbMATH DE number 3908167
• scientific article; zbMATH DE number 43711
• The dual branch and bound method
• Multi-objective branch and bound

Cited in

(14)

• Blocked branch-and-bound method
• Modified branch-and-bound method for solving a series of problems
• Branch-and-bound as a higher-order function
• A branch-and-price-and-cut method for computing an optimal bramble
• Resolution search and dynamic branch-and-bound
• A branch-and-bound based method for solving monotone optimization problems
• Branch-and-bound and objective branching with three or more objectives
• About branch and bound method
• Recursive branch and bound
• scientific article; zbMATH DE number 43711 (Why is no real title available?)
• scientific article; zbMATH DE number 1163867 (Why is no real title available?)
• Branch-and-cut for complementarity-constrained optimization
• scientific article; zbMATH DE number 850295 (Why is no real title available?)
• Exact solution of two location problems via branch-and-bound

This page was built for publication: Branch-and-bound methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3081834)