1
$\begingroup$

How would one go about enumerating all the optimal answers for interval scheduling?

Not sure what to begin with, my guess is to use the other approaches i.e. earliest start time, shortest interval and fewest conflict in conjunction with the optimal implementation which is to use the earliest finish time approach.

$\endgroup$
  • 2
    $\begingroup$ Branch-and-bound algorithms are easy to extend to find all optimal solutions. There may be many, though. (Why do you have Greedy in the title?) $\endgroup$ – Raphael Aug 13 '16 at 9:03

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.