The lower bound on complexity of parallel branch-and-bound algorithm for subset sum problem

2016 ◽  
Author(s):  
Roman Kolpakov ◽  
Mikhail Posypkin
Keyword(s):  
Lower Bound ◽  
Branch And Bound ◽  
Branch And Bound Algorithm ◽  
Subset Sum Problem ◽  
Parallel Branch And Bound ◽  
Subset Sum

A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem

1984 ◽  
Vol 30 (6) ◽  
pp. 765-771 ◽  
Author(s):  
Silvano Martello ◽  
Paolo Toth
Keyword(s):  
Dynamic Programming ◽  
Branch And Bound ◽  
Subset Sum Problem ◽  
Subset Sum

scholarly journals Parallel Branch and Bound Algorithm with the Hierarchical Master-Worker Paradigm on the Grid

2006 ◽  
Vol 2 ◽  
pp. 584-597 ◽  
Author(s):  
Kento Aida ◽  
Yoshiaki Futakata ◽  
Tomotaka Osumi
Keyword(s):  
Branch And Bound ◽  
Branch And Bound Algorithm ◽  
Parallel Branch And Bound
Sign in / Sign up

Export Citation Format

Share Document