Open access peer-reviewed chapter

# A Global Method for a Two-Dimensional Cutting Stock Problem in the Manufacturing Industry

Written By

Yao-Huei Huang, Hao-Chun Lu, Yun-Cheng Wang, Yu-Fang Chang and Chun-Kai Gao

Submitted: 04 July 2019 Reviewed: 27 August 2019 Published: 20 January 2020

DOI: 10.5772/intechopen.89376

From the Edited Volume

## Application of Decision Science in Business and Management

Edited by Fausto Pedro García Márquez

Chapter metrics overview

View Full Metrics

## Abstract

A two-dimensional cutting stock problem (2DCSP) needs to cut a set of given rectangular items from standard-sized rectangular materials with the objective of minimizing the number of materials used. This problem frequently arises in different manufacturing industries such as glass, wood, paper, plastic, etc. However, the current literatures lack a deterministic method for solving the 2DCSP. However, this study proposes a global method to solve the 2DCSP. It aims to reduce the number of binary variables for the proposed model to speed up the solving time and obtain the optimal solution. Our experiments demonstrate that the proposed method is superior to current reference methods for solving the 2DCSP.

### Keywords

• two-dimensional cutting stock problem (2DCSP)
• rectangular items
• optimal solution
• deterministic model

## 1. Introduction

Two-dimensional cutting stock problem (2DCSP) is a well-known problem in the fields of management science and operations research. The problem frequently arises in the manufacturing processes of different products such as wood, glass, paper, steel, etc. In the 2DCSP, a set of given rectangular items is cut from a set of rectangular materials with the aim of determining the minimum number of materials [1, 2]. These applications include sawing plates from wood stocks [3], reel and sheet cutting at a paper mill [4], cutting plates of thin-film-transistor liquid-crystal display (TFT-LCD) from glass substrate [5, 6], placing devices into a system-on-a-chip circuit [7], and container loading or calculation of containers [8, 9]. Minimizing the number of materials is normally the target in this type of the problem because it does not only reduce the overhead consumption but also enhances environmental protection. The problem in the literatures have been classified as one-dimensional, 1.5-dimensional, and 2DCSPs (Hinxman [10] and Lodi et al. [11]) and suggested two categories of approaches in solving the problems, namely, the heuristic and deterministic approaches (Belov [12], Burke et al. [13], Chen et al. [14], Hopper and Turton [15], Lin [16] and Martello et al. [17]).

Various heuristic approaches have been proposed and discussed in the literatures. The primary advantage of this approach is easier in solving the 2DCSP within an acceptable and economical timeframe [18, 19]. The feasible solution is obtained within a reasonable time, while the optimal solution cannot be guaranteed. Chazelle [20] first proposed a popular heuristic algorithm, called the bottom-left heuristic algorithm. Berkey and Wang [21] proposed a finite best strip heuristic algorithm to improve the original bottom-left method which packs the items directly into the bins with a best-fit policy. On the other hand, Lodi et al. [22] proposed an integrated heuristic approach that initiates the solution by paralleling the edges of the items and bins (i.e., materials) and utilizes a Tabu search [23, 24] to explore the neighborhood and refine the possible solution. In order to enhance the effectiveness of the algorithm used, Boschetti and Mingozzi [25, 26] consider empty bins in turn and fill the bins with items in a sequence defined by the prices attributed to the items and update them iteratively. Likewise, Monaci and Toth [27] initially used Lagrangian-based heuristic to generate a set of covering programming model to obtain a lower bound solution, in which the items cannot be rotated. They applied geometric analytical techniques and Dantzig-Wolfe decomposition to produce various lower bounds of the 2DCSP so that a better solution can be compared and obtained [28, 29, 30, 31].

Despite the development of heuristic approaches can obtain possible solution in a reasonable time, however there is a scarcity of literature attempting to ensure the achievement of an optimal solution. Moreover, the distance between one random feasible solution and the actual global optimal solution can be enlarged with an increasing problem size. Only a few studies attempted to develop deterministic approaches for an optimal solution. For example, Chen et al. [32] formed a mathematical model for packing a set of given rectangular items into a rectangular space in which the dimension of the rectangular space is minimized. The packing problem is equal to the cutting problem, and the problem can also be called as an assortment problem. Moreover, Williams [33] formulated a mathematical model considering the increased generalization of 2DCSP, to solve the problem with various sizes of bins. However, Williams’ model contains an excessive number of binary variables as indicated by Pisinger and Sigurd [31] who showed that Williams’ model has difficulty in solving a standard 2DCSP by their computational experiments. The subsequent studies by Li and Chang [34], Li et al. [35, 36], Hu et al. [37], and Tsai et al. [38] (these approaches are called Li’s approach in this study) enhanced Chen’s model with reformulation techniques based on reducing binary variables and piecewise linearization technique. The deterministic approaches can guarantee the achievement of global optimization with an acceptable tolerance; however, these approaches are only suitable for the assortment problem (i.e., cutting rectangular items from one material only), while many manufacturing situations require considering minimal number of materials.

Aiming to close the knowledge gap, this study modifies the two programs of the assortment problem proposed by Chen et al. [32] and Li and Chang [34] to be two corresponding deterministic models for the 2DCSP. As an innovative approach, a global approach of the 2DCSP with a logarithmic number of binary variables and extra constraints is proposed and demonstrated.

The remainder of this study is organized as follows: Section 2 discusses the 2DCSP formulations. Section 3 proposes the 2DCSP models with logarithmic number of binary variables and extra constraints. Numerical examples are given in Section 4 to demonstrate the theoretical advances and advantages of the proposed global approach. Section 5 gives the concluding remarks.

## 2. Problem formulations

Given n small rectangular items, the 2DCSP is to cut all items within large rectangular materials with the objective of minimizing the number of materials used. Denote x and y as the width and the length of the enveloping rectangle. By referring to the method of Chen et al. [32], a mathematical program can be formed with the objective of minimizing the volume (i.e., Min xy) as discussed in Section 2.1. In the 2DCSP, the minimal number of materials can reduce the manufacturing costs. Thus Section 2.2 explains how to reformulate two new 2DCSP programs based on the original model in Section 2.1. Firstly, the terminologies, including decision variables and parameters, are introduced in Tables 1 and 2.

### 2.1 Cutting problem in one material

The cutting problem considering one material is also called the assortment problem, which considers cutting a set of given rectangular items within a rectangular material of minimum area. Avoiding the overlapping of items is the core requirements. Chen et al. [32] and Li and Chang [34] use four binary variables ai,jbi,jci,jdi,j and two binary variables ui,jvi,j, respectively, to handle the non-overlapping conditions, as shown in Table 3.

ParameterMeaning
nThe number of given rectangular items needed to be cut
mThe number of rectangular materials with the same size
piqiThe width and length of given rectangular item i for i=1,,n
x¯y¯x¯ and y¯ are the upper bounds of x and y, respectively. These items also denote the width and length of a given rectangular material

### Table 1.

Parameters in the 2DCSP.

VariableMeaning
xiyiThe bottom-left coordinate of rectangular item i
xyThe top-right coordinate of the rectangular material
ai,jbi,jci,jdi,jA set of binary variables expressing the non-overlapping conditions for a pair of rectangular items i and rectangular items j for i<j, which are defined by Chen et al. [32]
ui,jvi,jA pair of binary variables expressing the non-overlapping conditions for a pair of rectangular items i and rectangular items j for i<j, which are defined by Li and Chan [34]
siAn orientation indicator for a given rectangular item i. si=1 if pi is parallel to the x-axis; otherwise, si=0 if pi is parallel to the y-axis (si is a binary variable)
YThe accumulated length of all materials used.

### Table 2.

Decision variables in the 2DCSP.

### Table 3.

Four cases of non-overlapping conditions.

The following assortment program is proposed by Chen et al. [32]:

Original (a)

Minxy

s.t.xj+pjsj+qj1sjxi+x¯1ai,jfori,j=1,,nandi<j,E1
xi+pisi+qi1sixj+x¯1bi,jfori,j=1,,nandi<j,E2
yj+qjsj+pj1sjyi+y¯1ci,jfori,j=1,,nandi<j,E3
yi+qisi+pi1siyj+y¯1di,jfori,j=1,,nandi<j,E4
ai,j+bi,j+ci,j+di,j=1fori,j=1,,nandi<j,E5
xi+pisi+qi1sixx¯fori=1,,n,E6
yi+qisi+pi1siyy¯fori=1,,n,E7

where ai,j,bi,j,ci,j,di,j, and si are binary variables; xi and yi are nonnegative continuous variables; Constraints (1)(5) ensure that the rectangular items are non-overlapping, and Constraints (6) and (7) are to cut all of the rectangular items within an enveloping rectangular material x¯y¯.

Remark 1. Original (a) uses 2n2n binary variables (ai,j,bi,j,ci,j,di,j) and 2.5nn1+2n constraints to formulate an assortment problem with n rectangular items.

By referring to Li and Chang [34], an alternative mathematical model can be expressed as follows:

Original (b)

Min xy

s.t. (6) and (7),

xj+pjsj+qj1sjxi+x¯ui,j+vi,jfori,j=1,,nandi<j,E8
xi+pisi+qi1sixj+x¯1ui,j+vi,jfori,j=1,,nandi<j,E9
yj+qjsj+pj1sjyi+y¯1+ui,jvi,jfori,j=1,,nandi<j,E10
yi+qisi+pi1siyj+y¯2ui,jvi,jfori,j=1,,nandi<j,E11

where ui,j,vi,j, and si are binary variables; xi and yi are nonnegative continuous variables; and Constraints (8)(11) ensure that the rectangular items are non-overlapping.

Remark 2. Original (b) uses n2 binary variables (ui,j, vi,j) and 2n2 constraints to formulate an assortment problem with n rectangular items.

However, these two models are inappropriate for directly solving the general 2DCSP because the objective of the 2DCSP must minimize the number of materials used for cutting all items. By referring to the two models above, two corresponding 2DCSP models are proposed in Section 2.2.

### 2.2 General deterministic models of 2DCSP

As mentioned above, we need to find out the minimal number of materials used for cutting all items. Original (a) is then reformulated as a general deterministic model of 2DCSP, where cutting n rectangular items from m materials, as shown in P1 (a):

P1 (a)

MinY

s.t. (1), (2) and (5) in Original (a),

yj+qjsj+pj1sjyi+my¯1ci,jfori,j=1,,nandi<j,E12
yi+qisi+pi1siyj+my¯1di,jfori,j=1,,nandi<j,E13
xi+pisi+qi1six¯fori=1,,n,E14
yi+qisi+pi1sik=1mky¯Qi,kfori=1,,n,E15
yik=1mk1y¯Qi,kfori=1,,n,E16
k=1mQi,k=1fori=1,,n,E17
yi+qisi+pi1siYfori=1,,n,E18

where si,ai,j,bi,j,ci,j,di,j, and Qi,k are binary variables; xi,yi and Y are nonnegative continuous variables; Constraints (1), (2), (5), (12) and (13) ensure that the rectangular items are non-overlapping; Constraints (15)(17) mean that each rectangular item is fitly cut from one of the m materials; Constraint (18) obtains the accumulated length of materials used; and the objective function minimizes the accumulated length of materials used.

There are nm new binary variables (i.e., Qi,kfori=1,2,,nandk=1,2,,m) in Constraints (15)(17) of P1 (a) model. It aims to cut the ith rectangular item from the kth material if Qi,k=1, and Constraint (17) forces any rectangular item to be cut from one of such materials. Supposing that rectangular item i is cut from the kth material, then Qi,k=1 and Qi,k=0 for kk and k=1,2,,m. Constraints (15)(17) will force the y-axis position of rectangular item i cut from the kth material as shown below:

yi+qisi+pi1siky¯,E19
k1y¯yi.E20

Remark 3. P1 (a) requires 2n2n1m binary variables and 5n2+3n/2 constraints to form a 2DCSP program.

Referring to the Original (b), another corresponding 2DCSP program can be formulated as follows:

P1 (b)

Min Y

s.t. (8), (9), (14)(18),

yj+qjsj+pj1sjyi+my¯1+ui,jvi,jfori,j=1,,nandi<j,E21
yi+qisi+pi1siyj+my¯2ui,jvi,jfori,j=1,,nandi<j,E22

where si,ui,j,vi,j, and Qi,k are binary variables and xi,yi, and Y are nonnegative continuous variables.

Remark 4. P1 (b) requires n2+nm binary variables and 2nn+1 constraints to formulate a 2DCSP program.

Although both P1 (a) and P1 (b) can obtain a minimal number of materials used, there is mainly an issue needed to be addressed. That is, an excessive number of binary variables Qi,k is used to assign rectangular item i into one of the materials; such that the computational load becomes a serious burden as the size of the problem grows.

As indicated by Li et al. [39], reducing the number of binary variables can accelerate the solving speed. Hence, we can roughly estimate the number of materials by the following remark.

Remark 5. The number of materials can be reduced from m to f where fm by the following initial calculating:

fi=1nxiyix¯×y¯,E23

where if f value is not big enough, i.e., in solving P1(a) and P1(b) are infeasible, then we can accumulate f, i.e., f=f+1, until feasible solutions exist.

By referring to Remark 5, the number of binary variables in Constraints (15)(18) can be reduced from nm to nf where fm. Moreover, this study proposes a reformulation technique using logarithmic number of binary variables for the P1 (a) and P1 (b) models. The detail of technique is then discussed in Section 3.

## 3. Logarithmic reformulation technique of 2DCSP

After considering Remark 5, for a 2DCSP with n rectangular items and f materials, the P1 (a) and P1 (b) models will require nf binary variables (Qi,k) to cut each rectangular item from one of the materials. The computational efficiency of the P1 (a) and P1 (b) models become a serious burden when an increasing size of the 2DCSP. For any rectangular item i, Constraint (17) (k=1fQi,k=1) is an SOS1 constraint [40], which is an ordered set of variables where only one variable may be one. An SOS1 constraint model with size f will generally require f binary variables. However, Vielma and Nemhauser [41] use SOS1 constraint with a logarithmic number of binary variables and constraints. This section utilizes the concept of Vielma and Nemhauser [41] and introduces the binary variables Qi,r (i=1,,n and r=1,,log2f) to replace the original binary variables (Qi,k) of the P1 (a) and P1 (b) models. Thus, the number of required binary variables can be reduced from nf to nlog2f. The following remarks and propositions discuss the logarithmic reformulation technique of the 2DCSP.

Remark 6. Let K=12f=2θ, θ=log2f, and kK be the injective function for B:122θ01θ, which can be expressed as follows:

Bk=w1w2wθTandwr=1k2r1%2forr=1,,θ.E24

Proposition 1. Let K=1f, θ=log2f and kK; the original SOS1 Constraint in (25) which requires f binary variables Qk can be replaced by the Constraint set (26) and (27):

k=1fQk=1andQk01.E25

The Constraint set (25) and (26) only requires θ binary variables Qr, 2θ additional constraints, and f additional continuous variables λk:

k=1fλk=1,E26
kS+rλk=Qrforr=1,,θ,E27

where

1. Qr01.

2. Bk is an injective function based on Remark 6 (i.e., Bk=w1w2wθT with wr01 for r=1,,θ).

3. S+r=kKBkwherewr=1 and Sr=kKBkwherewr=0.

Proof: Following Li et al. [39], Constraints (26) and (27) are used to construct the SOS1 property.

Following Proposition 1, we then have Proposition 2 that uses log2f binary variables to determine whether rectangular item i could be exactly cut from one of the given materials.

Proposition 2. Let f be the number of materials, y¯ the length of material, and yi the y-axis position of rectangular item i. The original Constraint set (15)(17) of the P1 (a) and P1 (b) models will be re-expressed by the following linear system, which holds the rectangular item i to be cut from one of the given materials:

yi+qisi+pi1sik=1fky¯λi,kfori=1,,n,E28
yik=1fk1y¯λi,kfori=1,,n,E29
k=1fλi,k=1fori=1,,n,E30
kS+rλi,k=Qi,rfori=1,,nandr=1,,θ=log2f,E31

where S+r and Sr are the same as the notations in Proposition 1 and si,Qi,r01.

Proof: According to Proposition 1, the continuous variables λi,k with the Constraint set (30) and (31) have the characteristics of binary variables. Therefore, the Constraint set (28)(30) is equivalent to the Constraint set (15)(17).

Two types of 2DCSP models are formulated by utilizing Proposition 2 as the following P2 (a) and P2 (b), respectively:

P2 (a)

Min Y

s.t. (1), (2), (5), (12)(14), (18) and (28)(31),

where Y,xi,yi,λi,k0 and ai,j,bi,j,ci,j,di,j,si,Qi,r01 for i,j=1,,n, i<j, k=1,,f, and r=1,2,log2f.

Remark 7. P2 (a) requires n2n+log2f1 binary variables and 5n2+10n+log2f constraints to express a 2DCSP model.

P2 (b)

Min Y

s.t.(8), (9), (14), (18), (28)(31),

where Y,xi,yi,λi,k0 and si,ui,j,vi,j,Qi,r01 for i,j=1,,n, i<j, k=1,,f and r=1,,log2f.

Remark 8. P2 (b) requires nn+log2f binary variables and n2n+2log2f+3 constraints to express another 2DCSP model.

Table 4 shows a comparison of the four ways of expressing the 2DCSP, and it clearly lists the number of binary variables, auxiliary continuous variables, and constraints.

ItemsP1(a)P1(b)P2(a)P2(b)
Concept of non-overlappingChen et al. [32]Li and Chang [34]Chen et al. [32]Li and Chang [34]
Constraints for assigning rectangular items into materialsk=1fQi,k=1k=1fQi,k=1Proposition 2Proposition 2
No. of binary variables2n2n1fn2+nfn2n+θ1nn+θ
No. of continuous variables2n+12n+12n+nf+12n+nf+1
No. of constraints5n2+5n/22n2+3nn5n+10+4θn2n+2θ+3
where θ=log2f

### Table 4.

Comparison of the four ways of expressing the 2DCSP.

## 4. Numerical examples

There are two examples modified from Tsai et al. [38]. The detail sizes of rectangular items and materials are listed in Table 5. We implement a Java program, which embedded an optimization package GUROBI (2011) as an MIP solver for solving the two examples with the four proposed models (P1 (a), P1 (b), P2 (a), P2 (b)). The experimental tests were run on a PC equipped with an Intel® Core™ 2 Duo CPU, 4GB RAM, and 32 bit Windows 7 operating system.

ProblemSize of materialQty. of itemsfSize of items (pi, qi)
1(40, 69)82(25, 20), (16, 20), (15, 20), (14, 20), (20, 18), (15, 17), (30, 16), (30, 14)
2(25, 150)122(32, 24), (26, 20), (25, 20), (24, 20), (40, 18), (35, 17), (20, 16), (18, 16), (38, 15), (50, 15), (18, 4), (25, 5)

### Table 5.

Sizes of rectangular items and materials.

The two problems with the number of materials firstly estimated to be 2 (i.e., f=2) are solved by using the four models including P1(a), P1(b), P2(a), and P2(b). Table 6 shows the experiment results of two problems. Both of Figures 1 and 2 depict the visualization solutions. In solving four models, we obtain the same objective values of (83) and (293) in Problem 1 and Problem 2, respectively. The results clearly indicate that solving P2(a) and P2(b) is much more computationally efficient than that of P1(a) and P1(b). By observing the four models, we know that both P2(a) and P2(b) use proposed approach to reduce the numbers of binary variables. The results demonstrate that the adoption of a smaller number of binary variables can enhance the solving efficiency in solving 2DCSP.

ItemsP1 (a)P1 (b)P2 (a)P2 (b)
Problem 2
Y = 83
No. of 0–1 variables1368012872
No. of cont. variables17173333
No. of constraints180152404168
Iterations621,821686,982263,296293,432
Nodes176,776211,56470,154111,173
Solving time18.818.07.59.1
Problem 2
Objective = 293
No. of 0–1 variables300168288156
No. of cont. variables25254949
No. of constraints390324844348
Iterations31,166,3571,017,9221,114,911805,136
Nodes9,766,654244,444266,672229,701
Solving time856.524.534.919.4

### Table 6.

Experiment results of two problems.

## 5. Conclusions

This study develops a logarithmic reformulation technique for reducing the required binary variables of the mixed integer program for two-dimensional cutting stock problem in the manufacturing industry. A reformulated logarithmic technique in the deterministic method reduces the number of binary variables to speed up the solving time. The deterministic methods are guaranteed to find a global optimal solution, but the computational complexity grows rapidly by increasing the number of variables and constraints. Future studies are suggested to enhance the computational efficiency for globally solving large-scale 2DCSP, such as column generation, cloud computing and meta-heuristic algorithms.

## References

1. 1. Dyckhoff H. A typology of cutting and packing problems. European Journal of Operational Research. 1990;44:145-159
2. 2. Wäscher G, Hauβner H, Schumann H. An improved typology of cutting and packing problems. European Journal of Operational Research. 2007;183:1109-1130
3. 3. Reinders MP. Cutting stock optimization and integral production planning for centralized wood processing. Mathematical and Computer Modelling. 1992;16:37-55
4. 4. Correia MH, Oliveira JF, Ferreira JS. Reel and sheet cutting at a paper mill. Computers and Operations Research. 2004;21:1223-1243
5. 5. Tsai JF, Hsieh PL, Huang YH. An optimization algorithm for cutting stock problems in the TFT-LCD industry. Computers and Industrial Engineering. 2009;57:913-919
6. 6. Lu HC, Huang YH, Tseng KA. An integrated algorithm for cutting stock problems in the thin-film transistor liquid crystal display industry. Computers and Industrial Engineering. 2013;64:1084-1092
7. 7. Lim SK. Physical design for 3D system on package. IEEE Design and Test of Computers. 2005;22:532-539
8. 8. Pisinger D. Heuristics for the container loading problem. European Journal of Operational Research. 2002;141:382-392
9. 9. Wang Z, Li KW, Levy JK. A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach. European Journal of Operational Research. 2008;191:86-99
10. 10. Hinxman AI. The trim-loss and assortment problem: A survey. European Journal of Operational Research. 1980;5:8-18
11. 11. Lodi SM, Vigo D. Recent advances on two-dimensional bin packing problems. Discrete Applied Mathematics. 2002;123:379-396
12. 12. Belov G. Problems, Models and Algorithms in One- and Two-Dimensional Cutting [Ph.D. Thesis]. Technischen University Dresden; 2003
13. 13. Burke EK, Kendall G, Whitewell G. A new placement heuristic for the orthogonal stock-cutting problem. Operations Research. 2004;52:655-671
14. 14. Chen CS, Lee SM, Shen QS. An analytical model for the container loading problem. European Journal of Operational Research. 1995;80:68-76
15. 15. Hopper E, Turton B. A genetic algorithm for a 2D industrial packing problem. Computers and Industrial Engineering. 1999;37:375-378
16. 16. Lin CC. A genetic algorithm for solving the two-dimensional assortment problem. Computers and Industrial Engineering. 2006;50:175-184
17. 17. Martello S, Pisinger D, Vigo D. The three-dimensional bin packing problem. Operations Research. 2000;48:256-267
18. 18. Jakobs S. On genetic algorithms for the packing of polygons. European Journal of Operational Research. 1996;88:165-181
19. 19. Leung TW, Chan CK, Troutt MD. Application of a mixed simulated annealing-genetic algorithm for a 2D packing problem. European Journal of Operational Research. 2003;145:530-542
20. 20. Chazelle B. The bottom-left bin-packing heuristic: An efficient implementation, computers. IEEE Transactions on Computers. 1983;100:697-707
21. 21. Berkey JO, Wang PY. Two-dimensional finite bin-packing algorithms. Journal of the Operational Research Society. 1987;38:423-429
22. 22. Lodi SM, Vigo D. Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS Journal of Computing. 1999;11:345-357
23. 23. Glover F, McMillan C. The general employee scheduling problem: An integration of MS and AI. Computers and Operations Research. 1986;13:563-573
24. 24. Glover F, Laguna M. Tabu Search. Boston: Kluwer Academic Publishers; 1997
25. 25. Boschetti MA, Mingozzi A. The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case, 4OR-Q. Journal of the Operational Research Society. 2003a;1:274-294
26. 26. Boschetti MA, Mingozzi A. The two-dimensional finite bin packing problem. Part II: New lower and upper bounds, 4OR: 4OR-Q. Journal of the Operational Research Society. 2003b;1:135-147
27. 27. Monaci M, Toth P. A set-covering-based heuristic approach for bin-packing problems. INFORMS Journal of Computing. 2006;18:71-85
28. 28. Dell’Amico M, Martello S, Vigo D. A lower bound for the non-oriented two-dimensional bin packing problem. Discrete Applied Mathematics. 2002;118:13-24
29. 29. Fekete SP, Schepers J. New classes of lower bounds for the bin packing problem. Mathematical Programming. 2001;91:11-31
30. 30. Martello S, Vigo D. Exact solution of the two-dimensional finite bin packing problem. Management Science. 1998;44:388-399
31. 31. Pisinger D, Sigurd M. The two-dimensional bin packing problem with variable bin sizes and cost. Discrete Optimization. 2005;2:154-167
32. 32. Chen CS, Sarin S, Balasubramanian R. A mixed-integer programming model for a class of assortment problems. European Journal of Operational Research. 1993;65:362-367
33. 33. Williams HP. Model Building in Mathematical Programming. fourth ed. Chichester: Wiley; 1999
34. 34. Li HL, Chang CT. An approximately global optimization method for assortment problems. European Journal of Operational Research. 1998;105:604-612
35. 35. Li HL, Chang CT, Tsai JF. Approximately global optimization for assortment problems using piecewise linearization techniques. European Journal of Operational Research. 2002;140:584-589
36. 36. Li HL, Tsai JF, Hu NZ. A distributed global optimization method for packing problems. The Journal of the Operational Research Society. 2003;54:419-425
37. 37. Hu NZ, Tsai JF, Li HL. A global optimization method for packing problems. Journal of the Chinese Institute of Industrial Engineers. 2002;19:75-82
38. 38. Tsai JF, Wang PC, Lin MH. An efficient deterministic optimization approach for rectangular packing problems. Optimization. 2013;62:989-1002
39. 39. Li HL, Huang YH, Fang SC. A logarithmic method for reducing binary variables and inequality constraints in solving task assignment problems. INFORMS Journal of Computing. 2013;25(4):643-653
40. 40. Beale EML, Forrest JJH. Global optimization using special ordered sets. Mathematical Programming: Series A and B. 1976;10:52-69
41. 41. Vielma JP, Nemhauser G. Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. Mathematical Programming. 2011;128:49-72

Written By

Yao-Huei Huang, Hao-Chun Lu, Yun-Cheng Wang, Yu-Fang Chang and Chun-Kai Gao

Submitted: 04 July 2019 Reviewed: 27 August 2019 Published: 20 January 2020