Abstract
The Branch & Bound algorithm is a method commonly used to solve optimization problems. Some examples of problems that the Branch & Bound algorithm can solve are Knapsack Problems, Traveling Salesman Problems, Scheduling Problems and many other optimization problems. Job Assignment Problem is one of the optimization problems of how to do n people doing n jobs where one person does one job. This paper will analyze the Branch and Bound Algorithm in solving Job Assignments Problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have