Branch And Bound Algorithm Analysis For Solving Job Assignment Problems

Main Article Content

Sriyani Violina, et. al.

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.

Downloads

Download data is not yet available.

Metrics

Metrics Loading ...

Article Details

How to Cite
et. al., S. V. . (2021). Branch And Bound Algorithm Analysis For Solving Job Assignment Problems. Turkish Journal of Computer and Mathematics Education (TURCOMAT), 12(11), 1272–1276. https://doi.org/10.17762/turcomat.v12i11.6031
Section
Research Articles