The rectangular two-dimensional Single Knapsack Problem (SKP) consists of packing a fixed rectangular space (so-called pallet) with a subset of smaller rectangular shapes (so-called pieces) of different dimensions, and without rotation. Pieces have different values. The objective is to maximize the sum of the values of the pieces packed. This paper proposes a new method for solving rectangular two-dimensional SKP based on the column generation approach. Mathematical formulation of the proposed model is simplest than the present mathematical formulations in the state-of-the art. The computational performance indicates that it is an effective method in the view of quality of solution.
Hatefi, M. A. (2017). Developing Column Generation Approach to Solve the Rectangular Two-dimensional Single Knapsack Problem. Scientia Iranica, 24(6), 3287-3296. doi: 10.24200/sci.2017.4401
MLA
Mohammad Ali Hatefi. "Developing Column Generation Approach to Solve the Rectangular Two-dimensional Single Knapsack Problem". Scientia Iranica, 24, 6, 2017, 3287-3296. doi: 10.24200/sci.2017.4401
HARVARD
Hatefi, M. A. (2017). 'Developing Column Generation Approach to Solve the Rectangular Two-dimensional Single Knapsack Problem', Scientia Iranica, 24(6), pp. 3287-3296. doi: 10.24200/sci.2017.4401
VANCOUVER
Hatefi, M. A. Developing Column Generation Approach to Solve the Rectangular Two-dimensional Single Knapsack Problem. Scientia Iranica, 2017; 24(6): 3287-3296. doi: 10.24200/sci.2017.4401
)