In this paper, various techniques such as Divide and Conquer, Greedy, and Dynamic Programming are used to solve the N/1/F problem. 4The algorithms are presented and proven theoretically. They are also tested with an example. Complexity analysis is then performed.These algorithms are different from the previous ones that solve the same problem in that they use the basic techniques of Operations Research in isolation. This simplicity is an attractive feature not only for purposes of implementation but also in understanding the problem and its solution.
/lp/association-for-computing-machinery/three-simple-algorithms-for-the-n-i-f-problem-VFiBlNtv8x