Heuristics for the 0-1 Min-Knapsack problem
by J. Csirik
Part of Working papers (European Institute for Advanced Studies in Management) -- no.90-06
No club is reading this yet — be the first to start one
1 readers worldwide want to read this book
Discuss Heuristics for the 0-1 Min-Knapsack problem with other readers
Join or start a book club for Heuristics for the 0-1 Min-Knapsack problem on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.
Frequently asked questions
How do I join a book club for Heuristics for the 0-1 Min-Knapsack problem?
Sign up free on Readfeed, then browse public clubs or start your own club with Heuristics for the 0-1 Min-Knapsack problem as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.
Can I discuss Heuristics for the 0-1 Min-Knapsack problem with other readers online?
Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Heuristics for the 0-1 Min-Knapsack problem with readers worldwide — whether your club is virtual, in-person, or hybrid.
Is Readfeed free?
Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.