This chapter presents the use of ordered cuts to solve the generalized assignment problem (GAP). The proposed approach is better compared to the transportation-based method that was proposed by one of the authors (EM) in 2014 and then improved in 2015. In that approach the GAP model was relaxed into a transportation problem. The solution of the relaxed transportation problem is continuously improved until it is feasible to the original GAP. The strength of the transportation branch and bound is that transportation sub-problems are easier to solve than the original linear programming (LP) based sub-problems. In this chapter ordered cuts have been generated from the original constraints and added to the given GAP model, and the problem is then solved by branch and bound algorithm. The proposed procedure has the advantage that the ordered cuts are easy to generate. In addition, these ordered cuts can be generated independently by parallel processors.