Scribd
Upload
4 views14 pages

Algorithm Assignment 18-22

The document discusses the application of the branch and bound algorithm to solve the knapsack problem, detailing computations at various nodes. It includes specific values for weights and capacities, as well as upper bounds calculated at each step. The overall goal is to determine the optimal solution for the knapsack's capacity constraints.

Uploaded by

s559093267
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
4 views14 pages

Algorithm Assignment 18-22

The document discusses the application of the branch and bound algorithm to solve the knapsack problem, detailing computations at various nodes. It includes specific values for weights and capacities, as well as upper bounds calculated at each step. The overall goal is to determine the optimal solution for the knapsack's capacity constraints.

Uploaded by

s559093267
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd

You might also like