Effects of Refactoring upon Efficiency of an NP-Hard Task Assignment Problem: A case study.
Huda TariqMaliha ArshadWafa BasitPublished in: ICACS (2020)
Keyphrases
- np hard
- computational complexity
- special case
- integer programming
- lower bound
- case study
- optimal solution
- scheduling problem
- linear programming
- high efficiency
- np complete
- greedy heuristic
- approximation algorithms
- computational efficiency
- worst case
- database
- data mining
- closely related
- minimum cost
- test bed
- source code
- branch and bound algorithm
- constraint satisfaction problems
- object oriented
- data sets
- real time