Blocked branch-and-bound method

MaRDI QIDQ1088598zbMATH OpenFDO

Authors Yu. S. Afonin

Publication date 1986

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

approximate methodblock branchingbranch-and-boundoptimal branching strategy

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Review text

We consider the choice of an optimal branching strategy in the branch- and-bound method (in the sense of minimum deviation from the optimal integer program) under constraints on computer time and memory. A blocked version of the branch-and-bound method has been developed, based on a block branching strategy. An approximate method of branching optimization is proposed, increasing the efficiency of the branch-and-bound solution. Some results of a computer experiment are given and a numerical example is analyzed.

Recommendations

• Branch-and-bound methods
• scientific article; zbMATH DE number 3908167
• Branch and bound methods for a search problem
• scientific article; zbMATH DE number 4009672
• About branch and bound method
• scientific article; zbMATH DE number 647691
• scientific article; zbMATH DE number 4074799
• The dual branch and bound method
• scientific article; zbMATH DE number 3307147

Cited in

(2)

• About branch and bound method
• Searching for optimal vine in pair-copula constructions

This page was built for publication: Blocked branch-and-bound method

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