An asynchronous P system with branch and bound for solving the subset sum problem.
Kosei NagaoAkihiro FujiwaraPublished in: CANDAR (Workshops) (2021)
Keyphrases
- branch and bound
- combinatorial optimization
- integer programming problems
- lower bound
- branch and bound algorithm
- search algorithm
- branch and bound search
- column generation
- search space
- upper bound
- bnb adopt
- optimal solution
- branch and bound procedure
- partial solutions
- implicit enumeration
- branch and bound method
- search strategies
- tree search
- depth first search
- randomly generated problems
- previously solved
- integer program
- simulated annealing
- lagrangian heuristic
- beam search
- network design problem
- linear programming relaxation
- mathematical programming
- traveling salesman problem
- metaheuristic
- optimization problems
- tree search algorithm
- lagrangian dual
- neural network
- artificial bee colony algorithm
- knapsack problem
- distributed constraint optimization
- linear programming
- genetic algorithm