Skip to content

Instantly share code, notes, and snippets.

@stackdump

stackdump/knapsack.ipynb

Created January 3, 2025 21:57
Show Gist options
  • Save stackdump/7351cba2958626fe6196b566069ccb1e to your computer and use it in GitHub Desktop.
Save stackdump/7351cba2958626fe6196b566069ccb1e to your computer and use it in GitHub Desktop.
Download ZIP
A continuous version of knapsack problem using Petri-net derived ODEs
Display the source blob
Display the rendered blob
Raw
knapsack.ipynb
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
@stackdump
Copy link
Author

Read part 2 to see an analysis comparing the result when suppressing 1 item at a time

https://gist.github.com/stackdump/af151355d414491ac2eff9160e134892

@stackdump
Copy link
Author

Python code referenced from https://www.geeksforgeeks.org/0-1-knapsack-using-least-count-branch-and-bound/

@stackdump
Copy link
Author

Screenshot 2025-01-04 at 9 54 42 AM

Above is a model of the nodes in the branch-and-bound approach

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment