Selection of feasible cutting patterns in order to minimize the raw material wastage which is known as cutting stock problem has become a key factor of the success in today’s competitive manufacturing industries. In this paper, solving a rectangular shape medium size two-dimensional cutting stock problem is discussed. Our study is restricted to raw materials (main sheets) in a rectangular shape with fixed sizes, and cutting items are also considered as rectangular shape with known dimensions and location of each feasible cutting pattern inside the main sheet is given in Cartesian Coordinate Plane. The Branch and Bound approach in solving integer programming problems is used to solve the problem.