Is tree structure and pruning necessary?

[Lsc12358]

Hi, jomavera

Thank you very much for the code, but I have some questions. In some textbooks on branch pricing algorithms, it seems that the nodes are stored in a tree structure and pruned using upper and lower bounds. In your algorithm, priority queue is used and there seems to be no upper bound and pruning logic, are both correct?

Looking forward to your recovery, thank you very much!

[jomavera]

Hi, what you describe seems like Branch and Bound algorithm where you keep upper and lower bounds. In Branch and Price you have a Restricted Master Problem (RMP) where you keep adding columns or branching depending if the solution of the RMP is integral or not.