Pages that link to "Item:Q828198"
From MaRDI portal
The following pages link to Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method (Q828198):
Displaying 5 items.
- An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem (Q852950) (← links)
- Effective branching splitting method under cost constraint (Q952828) (← links)
- Parallel time and space upper-bounds for the subset-sum problem (Q955010) (← links)
- An improved balanced algorithm for the subset-sum problem (Q1713739) (← links)
- On the best choice of a branching variable in the subset sum problem (Q1744347) (← links)