On the NP-Hardness of Two Scheduling Problems Under Linear Constraints.
Kameng NipPublished in: IJTCS-FAW (2023)
Keyphrases
- np hardness
- linear constraints
- scheduling problem
- np hard
- approximation algorithms
- constraint databases
- optimal solution
- lower bound
- linearly constrained
- integer programming
- computational complexity
- special case
- worst case
- linear program
- knapsack problem
- tabu search
- probabilistic model
- quadratic program
- convex sets
- linear programming
- vehicle routing problem
- genetic algorithm
- objective function
- training data