An asynchronous P system for solving the minimum Steiner tree with branch and bound.
Reo UenoAkihiro FujiwaraPublished in: CANDARW (2023)
Keyphrases
- branch and bound
- combinatorial optimization
- steiner tree
- linear programming relaxation
- integer programming problems
- branch and bound search
- branch and bound algorithm
- lower bound
- search algorithm
- column generation
- upper bound
- search space
- optimal solution
- branch and bound procedure
- bnb adopt
- branch and bound method
- partial solutions
- tree search
- network design problem
- implicit enumeration
- shortest path
- integer program
- traveling salesman problem
- neural network
- lagrangian heuristic
- previously solved
- cost function