Efficient Branch and Bound on FPGAs Using Work Stealing and Instance-Specific Designs.
Heinrich RieblerMichael LassRobert MittendorfThomas LöckeChristian PlesslPublished in: ACM Trans. Reconfigurable Technol. Syst. (2017)
Keyphrases
- branch and bound
- lower bound
- branch and bound algorithm
- search algorithm
- search space
- column generation
- optimal solution
- upper bound
- randomly generated problems
- beam search
- combinatorial optimization
- max sat
- branch and bound method
- tree search algorithm
- lagrangian heuristic
- network design problem
- branch and bound procedure
- integer programming problems
- search strategies
- state space
- objective function
- partial solutions
- depth first search