A pseudo-polynomial time algorithm for solving the resource dependent assignment problem.
Dvir ShabtayGeorge SteinerLiron YedidsionPublished in: Discret. Appl. Math. (2015)
Keyphrases
- computational complexity
- cost function
- worst case
- learning algorithm
- approximation ratio
- matching algorithm
- high accuracy
- dynamic programming
- np hard
- significant improvement
- k means
- computational cost
- optimal solution
- objective function
- recognition algorithm
- detection algorithm
- times faster
- algebraic equations
- genetic algorithm
- quadratic programming
- selection algorithm
- convergence rate
- segmentation algorithm
- reinforcement learning
- gradient projection
- resource allocation
- theoretical analysis
- np complete
- expectation maximization
- probabilistic model
- association rules
- search space
- special case