Network Security Internet Technology Development Database Servers Mobile Phone Android Software Apple Software Computer Software News IT Information

In addition to Weibo, there is also WeChat

Please pay attention

WeChat public account

Shulou

What is the principle analysis of branch and price algorithm?

2025-02-23 Update From: SLTechnology News&Howtos shulou NAV: SLTechnology News&Howtos > Internet Technology >

Share

Shulou(Shulou.com)06/01 Report--

This article is to share with you about the principle of branch and price algorithm analysis is how, the editor feels very practical, so share with you to learn, I hope you can learn something after reading this article, say no more, follow the editor to have a look.

I believe you are also very curious about the mystery of branch and price. Today we will reveal the principle of the algorithm.

However, before that, please make sure that your knowledge of branch and bound and column generation must pass, and that you are very familiar with it.

Because branch and price algorithm is a combination of branch and bound and column generation.

Application background

Branch and price algorithm is the combination of branch and bound and column generation. How exactly is it combined? First look at a BP algorithm flow chart, I believe you will be much clearer:

three

Specific process

We know about branch and bound's process of solving integer programming, if you don't know, take a look at the following chart:

In this process, the bounding operation is obtained by solving the linear relaxation (LP relaxation) of the current problem. For a large-scale integer programming problem with many variables, there are undoubtedly a lot of linear relaxation (LP relaxation) variables. But in each node, it is not necessary to call column generation completely every time, reconstruct RMP and solve again. After the molecule, the RMP of the child node can directly move the RMP of the parent node, but because of the branching constraint, the RMP needs to add column again to solve the problem again in order to get the optimal result. The RMP of the child node is re-added with column, and the process of solving it again is the bound operation of the node. Then, by combining the above elements, our branch and price algorithm is formed.

The above is how the principle of the branch and price algorithm is parsed, and the editor believes that there are some knowledge points that we may see or use in our daily work. I hope you can learn more from this article. For more details, please follow the industry information channel.

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.

Views: 0

*The comments in the above article only represent the author's personal views and do not represent the views and positions of this website. If you have more insights, please feel free to contribute and share.

Share To

Internet Technology

Wechat

© 2024 shulou.com SLNews company. All rights reserved.

12
Report