Equivalence of the 0-1 integer programming problem to discrete generalized and discrete pure network models
by Fred Glover
Part of Working paper / Division of Research, Graduate School of Business Administration, Harvard University -- HBS 75-46
No club is reading this yet — be the first to start one
Discuss Equivalence of the 0-1 integer programming problem to discrete generalized and discrete pure network models with other readers
Join or start a book club for Equivalence of the 0-1 integer programming problem to discrete generalized and discrete pure network models 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 Equivalence of the 0-1 integer programming problem to discrete generalized and discrete pure network models?
Sign up free on Readfeed, then browse public clubs or start your own club with Equivalence of the 0-1 integer programming problem to discrete generalized and discrete pure network models as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.
Can I discuss Equivalence of the 0-1 integer programming problem to discrete generalized and discrete pure network models with other readers online?
Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Equivalence of the 0-1 integer programming problem to discrete generalized and discrete pure network models 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.