An asynchronous P system with branch and bound for the minimum Steiner tree.
Reo UenoAkihiro FujiwaraPublished in: Int. J. Netw. Comput. (2024)
Keyphrases
- branch and bound
- steiner tree
- linear programming relaxation
- lower bound
- branch and bound algorithm
- search algorithm
- search space
- column generation
- upper bound
- optimal solution
- branch and bound procedure
- combinatorial optimization
- branch and bound method
- minimum spanning tree
- lagrangian heuristic
- randomly generated problems
- facility location
- shortest path
- tree search
- network design problem
- spanning tree
- minimum cost
- neural network
- branch and bound search
- state space
- objective function
- tree search algorithm
- mixed integer programming
- computational complexity
- reinforcement learning