Branch and bound methods for combinatorial problems
by John D. C. Little
Part of Massachusetts Institute of Technology. Alfred P. Sloan School of Management. Working papers -- 178-66
No club is reading this yet — be the first to start one
Discuss Branch and bound methods for combinatorial problems with other readers
Join or start a book club for Branch and bound methods for combinatorial problems 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 Branch and bound methods for combinatorial problems?
Sign up free on Readfeed, then browse public clubs or start your own club with Branch and bound methods for combinatorial problems as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.
Can I discuss Branch and bound methods for combinatorial problems with other readers online?
Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Branch and bound methods for combinatorial problems 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.