Exact and approximation algorithms for the operational fixed interval scheduling problem
by Luk N. van Wassenhove
Part of Working papers / INSEAD -- no.92/08/TM
No club is reading this yet — be the first to start one
Discuss Exact and approximation algorithms for the operational fixed interval scheduling problem with other readers
Join or start a book club for Exact and approximation algorithms for the operational fixed interval scheduling 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 Exact and approximation algorithms for the operational fixed interval scheduling problem?
Sign up free on Readfeed, then browse public clubs or start your own club with Exact and approximation algorithms for the operational fixed interval scheduling problem as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.
Can I discuss Exact and approximation algorithms for the operational fixed interval scheduling problem with other readers online?
Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Exact and approximation algorithms for the operational fixed interval scheduling 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.