Pages that link to "Item:Q353698"
From MaRDI portal
The following pages link to Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem (Q353698):
Displaying 2 items.