ScholarLens Back to search
2011•Modern Electronics TechniqueRequires access

Research and Implementation of Branch and Bound Algorithm

Chunmei Wang

Open publisher page 0 citations

Abstract

The algorithm of branch and bound is a solution to search problems in the tree of solution space,whose main solution is breadth-first search(BFS) or the least cost first,and the central idea is pruning.The general strategy and implementation steps of the branch and bound algorithm are proposed.Taking the wiring problem of circuit board as an example,whose algorithm is designed and implemented.The efficiency of the branch and bound algorithm is verified through experimental data,and its high performance is showed.

About this research paper

What this paper is about

The algorithm of branch and bound is a solution to search problems in the tree of solution space,whose main solution is breadth-first search(BFS) or the least cost first,and the central idea is pruning.The general strategy and implementation steps of the branch and bound algorithm are proposed.Taking the wiring problem of circuit board as an example,whose algorithm is designed and implemented.The efficiency of the branch and bound algorithm is verified through experimental data,and its high performance is showed.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The algorithm of branch and bound is a solution to search problems in the tree of solution space,whose main solution is breadth-first search(BFS) or the least cost first,and the central idea is pruning.The general strategy and implementation steps of the branch and bound algorithm are proposed.Taking the wiring problem of circuit board as an example,whose algorithm is designed and implemented.The efficiency of the branch and bound algorithm is verified through experimental data,and its high performance is showed.

Key concepts: Branch and bound, Pruning, Algorithm, Computer science, Upper and lower bounds, Space (punctuation), Search tree, Tree (set theory)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Research and Implementation of Branch and Bound Algorithm — Research Paper | ScholarLens