I think it’s NP-complete for solution and NP- hard for optimizing.
-
-
-
That makes sense!
End of conversation
New conversation -
-
-
Most types of scheduling and timetabling problems tend to be NP-complete. Specific details might make it simpler and problems sizes are sometimes small. Typical general approaches might be local search heuristics and constraint programming.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
yeh i remember reading that it is
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.