Blocked branch-and-bound method
type: Item
instance of: scholarly article
title: Blocked branch-and-bound method
zbMATH Open document ID: 0612.90085
author: Yu. S. Afonin
published in: Automation and Remote Control
publication date: 1986-01-01T00:00:00Z
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.
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 3991282
zbMATH Keywords: optimal branching strategy
zbMATH Keywords: branch-and-bound
zbMATH Keywords: block branching
zbMATH Keywords: approximate method
MaRDI profile type: Publication
Recommended article: Q3081834
Recommended article: Q3686500
Recommended article: Branch and bound methods for a search problem
Recommended article: Q3759825
Recommended article: About branch and bound method
Recommended article: Q4308423
Recommended article: Q3806977
Recommended article: The dual branch and bound method
Recommended article: Q5588262
description: scientific article; zbMATH DE number 3991282