Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Clarification on scope of Knapsacks.jl #22

Closed
jlchan opened this issue Nov 25, 2023 · 2 comments
Closed

Clarification on scope of Knapsacks.jl #22

jlchan opened this issue Nov 25, 2023 · 2 comments
Assignees
@rafaelmartinelli
Labels
enhancement New feature or request

Comments

@jlchan
Copy link

jlchan commented Nov 25, 2023

Is there a list of types/variations of knapsack problems that Knapsacks.jl addresses? For example, does the package focus on the 0-1 traditional knapsack problem, or does it also address continuous knapsack problems and other variants?

I'm not that experienced in knapsack problems, so I couldn't tell for certain from the source code.
@jlchan jlchan added the enhancement New feature or request label Nov 25, 2023
@rafaelmartinelli
Copy link
Owner

DynamicProgramming, BinaryModel, and ExpandingCore solve the 0-1 Knapsack, and Heuristic solves a sort of fractional Knapsack (probably without the last item), but only with integral input.

@jlchan
Copy link
Author

jlchan commented Nov 25, 2023

Thank you!

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

@rafaelmartinelli rafaelmartinelli

Labels
enhancement New feature or request
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@jlchan @rafaelmartinelli