A student of mine is studying the knapsack problem (0-1 with a single objective). She is also talking to an industry partner who has realistic problems she can try solving (between 1000 to 10000 items).
We're having some trouble finding good references and existing implementations, mostly because I am not an expert in this area, but I ended up working with the student anyhow. I would appreciate some help with:
What are some reasonable heuristic and/or approximation 0-1 knapsack algorithms that are not too complicated that the student could study? (References please.)
Are there existing libraries which look for solutions or approximate solutions?