View on Coursera Course Description This course is part three of a specialization on algorithms and data structures. It covers basic algorithm design techniques such as divide and conquer, dynamic ...

To include the legislation in the restricted dynamic programming heuristic, we propose a break scheduling heuristic. Computational results show that our method finds solutions to benchmark ...

Mordechai I. Henig, The Principle of Optimality in Dynamic Programming with Returns in Partially Ordered Sets, Mathematics of Operations Research, Vol. 10, No. 3 (Aug., 1985), pp. 462-470 ...