Back to Results
First PageMeta Content
Computational complexity theory / Theory of computation / Combinatorial optimization / Complexity classes / Operations research / Integer programming / Heuristic / Branch and bound / NP / Optimization problem / Pruning / Reduction


RTGBeing Stubborn: Developing Optimal Solution Strategies for a Scheduling Problem Despite its NP-Hardness Dr. Oliver Sinnen Department of Electrical and Computer Engineering
Add to Reading List

Document Date: 2015-06-25 08:55:11


Open Document

File Size: 62,86 KB

Share Result on Facebook