Relations between capacity utilization and minimal bin number
|
|
- Sherman Sherman
- 5 years ago
- Views:
Transcription
1 Als Manuskript gedruckt Technische Universität Dresden Herausgeber: Der Rektor A note on Relations between capacity utilization and minimal bin number Torsten Buchwald and Guntram Scheithauer MATH-NM August 01
2 Contents 1 Introduction: problem formulation and goal 1 Preliminaries and notations 3 The theorem 6 4 Conclusions and outlook 1
3 A note on Relations between capacity utilization and minimal bin number Torsten Buchwald and Guntram Scheithauer Technische Universität Dresden July 01 Abstract In the paper Relations between capacity utilization and minimal bin number [HS1] the following two-dimensional bin packing problem (BPP) is considered: given a set K of rectangular items of sizes l i w i and bins of size L W. Rotation of the items is not permitted. It is shown, if every item fits into the given bin and if the total area of the items does not exceed the area of the bin then at most three bins are needed to pack all items. The bound three is tight. Furthermore, it is shown that if l i L/3 and w i W/3 for all i K then at most two bins are necessary to pack all items. In this note we give another, simplerproof of the latter resultwhich is based on properties of the FFDH-heuristic (instead of using NFDH-heuristic as in [HS1]), and we improve it to if l i L/ and w i W/3 for all i K then at most two bins are necessary. Key words: Cutting and Packing, Bin Packing Problem, Strip Packing Problem 1 Introduction: problem formulation and goal In this paper we consider as in [HS1] the two-dimensional bin packing problem (BPP) and the strip packing problem (SPP) with non-rotatable rectangular items: Let be given a list L(K) := {R i : i K} of small rectangles R i (items) of width l i > 0 and height w i > 0, i K := {1,...,n}. In the BPP the items have to be packed into a minimum number of rectangular bins of given width L and height W such that the items do not overlap each other and each of them fits completely into one of the bins, whereas in the SPP the height W of the bin is variable and has to be minimized. In [HS1] it is shown, if every item fits into the given bin, i.e. l i L and w i W for all i K, and if the total area of the items does not exceed the area of the bin, i.e. i K l iw i LW, then at most three bins are needed to pack all items. The bound three is tight. Furthermore, it is shown that if l i L/3 and w i W/3 for all i K then 1
4 A note on Relations between capacity utilization and minimal bin number at most two bins are necessary to pack all items. In order to prove these statements, properties of the well-known NFDH-heuristic (next fit, decreasing height, [CGJT80]) are used. In this paper we give another, simpler proof of the latter result which is based on properties of the FFDH-heuristic(first fit, decreasing height, [CGJT80]) and we improve it to if l i L/ and w i W/3 for all i I then at most two bins are necessary. Throughout the paper, for any set S K, or any list of rectangles L(S) := {R i : i S} with R i = l i w i, let A(L(S)) = A(S), l(s) and w(s) denote the total area, width, or height, i. e. A(S) := l i w i, l(s) := l i, w(s) := i. i S i S i Sw Moreover, let l max (S) := max{l i : i S} and w max (S) := max{w i : i S}. Preliminaries and notations For the sake of completeness we refer to Theorem 1 (Steinberg (1997) [Ste97]). If for a list L(K) of rectangles and a bin of size L W the following inequalities hold, l max (K) L, w max (K) W, A(K) LW (l max (K) L) + (w max (K) W) + then it is possible to pack all items into the bin. (As usual, (x) + = max{0,x}.) Note, in case of l max (K) L/ or w max (K) W/ then all items can be packed if their total area is at most 50% of the bin area. Consequently, if A(K) LW then all items fit in a rectangular bin of size L W or L W, but we cannot conclude that all items can be packed into two bins of size L W since the guillotine property is not guaranteed. In the following theorems we apply the well-known FFDH-heuristic in order to pack a single bin, denoted as FFDH 1 -heuristic, which works as follows: Let w j, j = 1,,..., s denote the heights of the (horizontal) strips obtained by the FFDH-heuristic applied for SPP with strip width L. Hence, w j w j+1 for j = 1,,..., s 1. Furthermore, let w s+1 := 0. In case not all items can be packed into a single bin by the FFDH-heuristic then s w j > W. We define s := argmax{ s w j W} as the number of strips packed by the FFDH 1 -heuristic. The FFDH 1 -heuristic stops just before the first item has to be packed into the (s + 1)st strip. Let K denote the item set packed by the FFDH 1 -heuristic. Additionally to the FFDH 1 -heuristic, we also consider the First-Fit Decreasing-Width 1 - heuristic (FFDW 1, transposed FFDH 1 -heuristic) where all items are sorted by nonincreasing width, and then they are packed sequentially in the left-most vertical strip in which they fit until the first item cannot be packed into the bin. As shown in [HS1], the (upper) bound three is tight in the case p = q = 1 when items with l i L/p, w i W/q for all i K and A(K) LW have to be packed into bins of
5 T, Buchwald, G. Scheithauer. August 3, 01 3 size L W. This bound is also tight for p = 1 and any q Z + = {1,,...}, and vice verse. Theorem. Let p = 1 and q Z +. Then there exist lists L(K) of items with l i L/p, w i W/q for all i K and A(K) LW such that at least three bins are needed to pack all items. Proof: The statement follows from the following example. Consider q + 1 items with l i = L+ε and w i = W+ε for some sufficient small positive ε and K = {1,...,q +1}. q+1 Then we have for a sufficient small positive ε: A(K) = l i w i = (q +1)( L+ε )( W +ε q +1 ) = (LW +ε(l+w +ε)) LW. q +1 q + i K Since only q items can be packed in one bin, at least three bins are necessary to pack all items. Lemma 3. Let q Z +, W/q w 1 w w n > 0 and n i=1 w i > W. Let s = argmax{ s i=1 w i W}. Then q s q +1 W w j W. Proof: Let us assume s w j < q W. Then w q+1 s+1 > W/(q +1). On the other hand, because of assumption, s q and due to the non-increasing sorting of the w i -values, we have s w j > s W q+1 = q W q+1 which leads to a contradiction. Corollary 4. Because of the non-increasing strip heights w j, j = 1,...,s generated by the FFDH 1 -heuristic, it follows: If not all items of K are packed by the FFDH 1 -heuristic, then we have for the total height used: q s q +1 W w j W. A similar result holds for the FFDW 1 -heuristic: Let l j, j = 1,...,s be the widths of the vertical strips obtained by the FFDW 1 -heuristic. In case not all items are packed then we have for the total width used: p s p+1 L l j L. In the FFDH 1 -heuristic we need to consider regular and non-regular items. If item r is packed into strip j and strip j is the highest non-empty strip at that time when item r is packed then r is called a regular item, otherwise a non-regular or fall-back item. Let K ij, j = 1,...,i, i = 1,...,s, denote the items set packed into strip j at the time before strip i + 1 has to be opened, i.e. when in strip i all regular items have been packed and probably some fall-back items in strips below strip i. Hence, K = s K sj. In case of K K the first item not packed into the bin, is denoted by k 0. CorrespondingtoK ij, j = 1,...,i, i = 1,...,s,wedefinetheusedwidth l ij := j K ij l j and area A ij := A(K ij ) = j K ij l j w j. Furthermore, for i = 1,...,s, let i := max{0, p p+1 L l ii }.
6 4 A note on Relations between capacity utilization and minimal bin number Theorem 5. Let p Z +, q Z +, and let l i L/p and w i W/q for all i K, and A(K) > 1 LW. Furthermore, it is assumed that not all items can be packed by the FFDH 1 -heuristic, i.e. K K, and k 0 is the first item not packed. If there does not exist any subset K K {k 0 } with A( K) 1 LW, that can be packed into the bin, then it holds w k0 < p+1 pq W. Proof: At first we show by induction i l ij p p+1 L i i, i = 1,...,s. (1) Initialization step i = 1: In this case, formula (1) reduces to l 11 p L max{0, p L l p+1 p+1 11 }, which is a valid inequality. Induction step: Let i {,...,s}, and let inequality (1) be fulfilled for i 1. If i 1 = 0 then i 1 l ij i 1 l i 1,j p p+1 L (i 1). Similar to the initialization step one can show the validity of inequality (1) also for i. In case of i 1 = p p+1 L l i 1,i 1 > 0 we distinguish two subcases: (i) Strip i does not contain any item k K ii with width l k < 1 L. p+1 1 Since the width of the first (regular) item in strip i is at least L+ p+1 i 1, and since at least p regular items are packed into strip i, we have l ii p L+ p+1 i 1. Since inequality (1) is valid for i 1 we obtain i l ij l ii + i 1 l i 1,j p L i+ p+1 i 1 i 1. Consequently, formula (1) is also fulfilled for i. (ii) Strip i contains a regular item t 0 with width w t0 < 1 L. p+1 This can only happen when further fall-back items with total width larger than i 1 are packed into strip i 1 beforeitem t 0 is packed into strip i. Hence, l i,i 1 l i 1,i 1 i 1. 1 Sincethefirstitemofstripihaswidthatleast L+ p+1 i 1 itfollowsbecauseofinduction i l ij l ii + i 1 l i 1,j + l i,i 1 l i 1,i 1 p L i p+1 i. Consequently, inequality (1) is fulfilled, and we obtain s l sj p L s p+1 s. If s = 0 then s l sj p p+1 L s. Otherwise, if s > 0, then we have l ss = p L p+1 s, and hence s 1 l sj p L s p+1 s l ss = p L (s 1). p+1 In order to construct a packing with s l sj p L s we replace strip s by another p+1 one as follows. Sort the items of K ss {k 0 } according to non-increasing width and pack them in this sequence into the s-th strip. Because of Corollary 4 the new packing of strip s has width l s p L. Consequently, the obtained new bin packing fulfills p+1 s 1 l sj + l s p L s. p+1
7 T, Buchwald, G. Scheithauer. August 3, 01 5 The rest of the proof is done by contradiction. Let w k0 p+1 W. Since at least q strips pq are packed into the bin, it follows for the total area A of the packed items: A s i=1 j K si l j w j s p+1 i=1 j K si l j W s p+1 pq i=1 l sj W s p p+1 L W pq p+1 pq q p p+1 L W = 1 LW which contradicts the assumption. p+1 pq Corollary 6. Let p Z +, q Z +, and let l i L/p and w i W/q for all i K, and A(K) > 1LW. If all items of K can be packed into a single bin, or if w k 0 p+1 W then pq there exists a subset K K with A( K) 1 LW which can be packed into a single bin. Proof: Since at least one of the assumptions of Theorem 5 cannot be fulfilled, either all items of K can be packed into a bin, or there exists a subset K with A( K) 1LW which can be packed into one bin. Since A(K) 1 LW, the statement follows. Corollary 7. Let p Z +, q Z +, and let l i L/p and w i W/q for all i K, and A(K) > 1LW. If all items of K can be packed into a single bin, or if l k 0 q+1 L (where pq k 0 denotes the first item which is not packed by the FFDW 1 -heuristic) then there exists a subset K K with A( K) 1 LW which can be packed into a single bin. Proof: The statement follows from the previous corollary applied on an instance with switched l i and w i, respectively L and W. Theorem 8. Let p Z +, and let l i L/p for i K. Then for the total area of items packed by the FFDH-heuristic it holds: A(K) = s A sj p L s w p+1 j+1. Proof: For i = 1,..., s we show by induction: i A ij p p+1 L i Initialization step i = 1: In this case, inequality () reduces to A 11 w ( p L max{0, p L l p+1 p+1 11 }), which is a valid inequality because of A 11 w l 11. Induction step: Let 1 < i s, and let () be fulfilled for i 1. If i 1 = 0 then i 1 A ij i 1 A i 1,j p p+1 L i 1 w j+1, w j+1 i w i+1 () and, similar to the initialization step, the validity of () can be shown also for i. In case of i 1 > 0 we distinguish two subcases: (i) Strip i does not contain any item with width smaller than 1 L. p+1 1 Since the width of the first (regular) item in strip i is at least L+ p+1 i 1, and since at least p regular items are packed into strip i, it follows that l ii p L+ p+1 i 1. Hence,
8 6 A note on Relations between capacity utilization and minimal bin number A ii ( p p+1 L+ i 1) w i+1 +( 1 p+1 L+ i 1) ( w i w i+1 ) p p+1 L w i+1 + i 1 w i. Using the induction hypothesis one obtains i A ij A ii + i 1 A i 1,j p L i p+1 w j+1 + i 1 w i i 1 w i and therefore inequality () holds also for i. (ii) Strip i contains a regular item t 0 with width smaller than 1 L. p+1 This can only happen when further, fall-back items have been packed into strip i 1 with total width larger than i 1 before item t 0 is packed into strip i. Therefore, 1 A i,i 1 A i 1,i 1 i 1 w i+1. Sincethefirstiteminstripihaswidthatleast L+ p+1 i 1, it follows with the induction hypothesis: i A ij A ii + i 1 A i 1,j +A i,i 1 A i 1,i 1 ( p p+1 L i) w i+1 +( 1 p+1 L+ i 1)( w i w i+1 )+ p p+1 L i 1 w j+1 i 1 w i + i 1 w i+1 p p+1 L i w j+1 i w i+1. Therefore inequality () is valid, and it follows with w s+1 = 0: A = s A sj p p+1 L s w j+1 s w s+1 = p p+1 L s w j+1. Corollary 9. As a consequence of this theorem it follows for the total height needed by the FFDH-heuristic for SPP to pack a set( K of items ) with A(K) LW: s w j p W. p q Proof: From Theorem 8 it follows: ( ) s w j p+1 A(K)+ w pl 1 p+1 LW + W = p W. pl q p q Corollary 10. Let A(K) LW and let l i L/3 and w i W/3 for all i K, i.e. p = q = 3. Then all items of L(K) can be packed into at most two bins. Proof: Because of the previous corollary, the FFDH-heuristic for SPP packs all items of K with total height not larger than s w j 5 W. On the other hand, using the 3 FFDH 1 -heuristic to fill a single bin covers at least 3 W of height because of Corollary 4. 4 Therefore, at most two bins are needed to pack all items of K. 3 The theorem Theorem 11. Let be given bins of size L W and a list of rectangular items L(K) with l max (K) L/, w max (K) W/3, i.e. p = and q = 3. If A(K) = i K l i w i LW then all items of L(K) can be packed into at most two bins.
9 T, Buchwald, G. Scheithauer. August 3, 01 7 Proof: Without loss of generality, we may assume that A(K) = LW, and we consider the following partition of the set of items: K 1 := {i K : l i 1 3 L} and K := {i K : l i > 1 3 L}. Case 1: Let A(K 1 ) 1 LW and A(K ) 1 LW. Because of Steinberg s theorem, item set K 1 as well as K can be packed into a bin so that at most two bins are needed to pack K. Case : Let A(K 1 ) 1 LW and A(K ) > 1 LW. Pack items of K according to the FFDW 1 -heuristic into the first bin. Here, and in the following, let B 1 denote those items packed into the first bin (either with FFDW 1, FFDH 1 or somehow else). Since l i > 1 L = q+1 L for all items of K 3 pq, it follows with Corollary 7 that there exists a subset K K with A( K ) 1 LW, which can be packed into the first bin. Because A(K \B 1 ) = LW A(B 1 ) 1 LW, these items can be packed into the second bin using Steinberg s theorem. Case 3: Let A(K 1 ) > 1 LW and A(K ) 1 LW. Pack items of K 1 according to the FFDH 1 -heuristic into the first bin, hence, now B 1 K 1, and let s denote again the number of (horizontal) strips. In case of A(B 1 ) 1 LW then all remaining items can be packed into the second bin due to Steinberg s theorem. In the following, let A(B 1 ) < 1LW and w i < p+1 W = W, i K pq 9 1\B 1 according to Theorem 5 applied on K 1, i.e. p = q = 3. Suppose, the last condition is not fulfilled, then because of Corollary 6 a subset K of K 1 would exists with A( K) 1 LW which can be packed into a bin. Hence, all items of K could be packed into two bins. Because of the sorting in FFDH 1 we have w i < 9 W for all items i K 1\B 1. With formula () and Theorem 5 we obtain A(B 1 ) p L s w p+1 j+1 s w s+1 > 3L(W w 4 1) s w s+1 (3) > 3 4 LW 3 (3L 4 3 L)W = 1 LW 1 LW Now, sort the items of K according to non-increasing height, and pack them leftjustified on top of the previous, as long as possible, until the bin height is reached, into the second bin (Fig. 1, left). Let W := w(k ). We distinguish three subcases: Subcase (i) Let W > W. Because of Corollary 4 the total height occupied in the second bin is at least 3 W. Since 4 A(K ) 1LW andl i > 1Lwe have w(k 3 ) < 3W. Let W := W (W 3W) = 7W W. 4 4 Pack the remaining, non-packed items of K right-justified, starting at the bottom of the bin on top of each other into the second bin. Above these items it remains an unused rectangularareawithsize 1L W (Fig. 1, right). Moreover, A(K ) > 1Lw(K 3 ) = 1LW. 3 We show that the items of K 1 \ B 1 can be packed into the unused area of the second bin. For the total area of the non-packed items of K 1 we have:
10 8 A note on Relations between capacity utilization and minimal bin number Figure 1: Packing of many items of K A(K 1 \B 1 ) = A(K) A(B 1 ) A(K ) < LW ( 1 LW LW ) LW = 1 LW LW + LW Therefore, A(K 1 \B 1 ) < ( 1 LW LW + L LW W) = LW + LW = LW + LW L W + 7LW L W = 35 LW L W + L (7W W). 4 Two subcases have to be investigated: (a) Let 4W 9 (7 W W) 0, then 4 A(K 1 \B 1 ) < 35 LW LW + L 16 6 (7W W) 4 = 35 LW LW + L 16 6 (7W W) (l 4 max (K 1 \B 1 ) L) +( 4W 9 (7W W)) 4 + < L (7W W) (l 4 max(k 1 \B 1 ) L) +(w max (K 1 \B 1 ) ( 7W W)) 4 + = L W (l max (K 1 \B 1 ) L ) +(w max (K 1 \B 1 ) W) +. Consequently, due to Steinberg s theorem, the items of K 1 \B 1 can all be packed into a rectangle of size 1 L W. (b) Let 4 W 9 (7 W W) > 0, then 4 A(K 1 \B 1 ) < LW L 6 W + L (7W 4 W) = LW L 6 W + L (7W 4 W)+ L 6 (w max(k 1 \B 1 ) ( 7 4 W W)) + L 6 (w max(k 1 \B 1 ) ( 7 4 W W)) LW L 6 W+L (7W 4 W)+L 6 ( 9 W (7 4 W W)) + L 6 (w max(k 1 \B 1 ) ( 7 4 W W)) + = LW L 6 W + L (7W 4 W)+ L 6 (4 9 W 7 4 W +W) L 6 (w max(k 1 \B 1 ) ( 7 4 W W)) + = LW + L (7W 4 W)+ L W L 6 (w max(k 1 \B 1 ) ( 7 4 W W)) + < L (7W 4 W) L 6 (w max(k 1 \B 1 ) ( 7 4 W W)) + = L (7W 4 W) ( 1 3 L L ) +(w max (K 1 \B 1 ) ( 7 4 W W)) + L (7W 4 W) (l max (K 1 \B 1 ) L ) +(w max (K 1 \B 1 ) ( 7 4 W W)) + = L W (l max (K 1 \B 1 ) L ) +(w max (K 1 \B 1 ) W) + Again, due to Steinberg s theorem, also in this subcase the items of K 1 \B 1 can all be packed into a rectangle of size 1 L W. Subcase (ii) Let W W and A(K ) LW 4 + LW 54. Because of W W all items of K are already packed on the left side of the second bin. For the total area of the not yet packed items of K 1 it holds: A(K 1 \B 1 ) := A(K) A(B 1 ) A(K ) LW ( 1 LW LW 54 ) (LW + LW) = LW
11 T, Buchwald, G. Scheithauer. August 3, 01 9 Because of l i 1 L i K there exists a non-occupied area of size 1 L W in the second bin. (cf. Fig 1, left). Due to Steinberg s theorem, all items of K 1 \B 1 can be packed into that rectangle. Subcase (iii) Let W W and A(K ) < LW + LW Therefore A(K 1 ) = A(K) A(K ) > LW ( LW + LW) = 3LW 1 LW We consider a partition of K 1 into K 1 := {i K 1 : w i 5 81 W} and K1 := {i K 1 : w i < 5 81 W}. and the following two subcases: (a) Let A( K 1 ) 1LW. Empty the first bin (i.e. set B 1 := ) and pack items of K 1 using the FFDH 1 -heuristic into the first bin (now B 1 K 1 ). In case not all items of K 1 are packed into the first bin and there exists no subset Ǩ1 K 1 with A(Ǩ1) 1 LW that can be packed into one bin then, because of formula () and Theorem 8, A(B 1 ) p L s p+1 w j+1 s w s+1 > 3L(W w 4 1) s w s+1 > 3 4 L56W 81 (3L 4 3 L)W = 14LW 1 LW = 1LW Since A(B 1 ) 1LW all items of K \ B 1 can be packed into the second bin due to Steinberg s theorem. (b) Let A( K 1 ) < 1 LW, then A(K 1 ) = A(K) A(K ) A( K 1 ) > LW ( LW + LW ) 1 LW = LW LW = 5 LW. Let M = {1,...,m} := K 1 \B 1 (with B 1 as defined at the beginning of Case 3) be sorted according to non-increasing item area. Because of Theorem 5 we have l i w i < 1 3 LW = 9 LW for all i M. Furthermore, let B 7 1 := B 1 = K 1 \M. Because of Theorem 5, all items of K 1 are packed in the first bin, i.e. K 1 B 1. Several subcases can occur: (1) Let l(k 1 ) L. Let j M denote the smallest index with j i=1 l iw i 1 54 LW. Let M := {1,...,j}. LW. 7 Moreover, because of the assumed sorting in M, we have A(M) = j i=1 l iw i < Next we show that all items of M can also be packed into the first bin besides those of B 1. In that case, then A(B 1 M) 1 LW 1 LW + 1 LW = 1 LW, and consequently, the remaining items can be packed into the second bin due to Steinberg s theorem. In order to show this we distinguish subcases: (A) Let A(B 1 ) 1 LW LW. Empty the first bin (i.e. B 1 = ) and pack all items of K 1 along the bottom side of the bin, i.e. B 1 := K 1. Above these items a non-used rectangular area of size L 3 W (Fig., left) remains. It holds, A(B 1 \K 1 )+A(M) 1LW 1 5 LW LW LW = LW = 1LW Hence, all items of (B 1 \K 1 ) M can be packed into a rectangle of size L 3 W. (B) Let A(B 1 ) > 1 LW 1 LW. 108 If A(K ) LW + LW then, similar to subcase (ii), a packing of K into two bins can be constructed. Otherwise,
12 10 A note on Relations between capacity utilization and minimal bin number k Figure : Packing of items of K 1 A(K 1 ) = A(K) A(K ) A( K 1 ) > LW ( LW 4 + LW 108 ) 1 LW = LW 4 LW 108 = LW Analogously to subcase (A), one obtains A(B 1 \K 1 )+A(M) 1 6 LW LW LW = LW = 1LW Therefore, also in this Subcase, the items of M (B 1 \K 1 ) can be packed into a rectangle of size L W. 3 () Let l(k 1 ) > L. Sort the items of K 1 according to non-increasing width, and pack them left-justified side by side along the bottom of the bin until the next item does not fit. Let K 1 denote the set of packed items. Because of Corollary 4, l( K 1 ) 3L and therefore A( K 4 1 ) 5 L. 108 Two cases are distinguished: (A) Let l( K 1 ) 7 L, then 9 A( K 1 ) 7 9 L5W = 175 LW. We consider the following partition of M: M 1 := {i M : l i w i LW} and M := {i M : l i w i > LW}. Two cases are distinguished: (α) Let A(M 1 ) 1 LW. 54 Let M 1 = {1,...,m 1 } be sorted according to non-increasing item area. Let j 1 M 1 denote the smallest index with j 1 i=1 l iw i 1 LW. Let M 54 1 := {1,...,j 1 }. Moreover, because of the assumed sorting in M 1, we have A(M 1 ) = j 1 i=1 l iw i LW. Analogously to the previous case we show that all items of (B 1 \ K 1 ) M 1 can be packed into the unused area of size L W. For their total area we have 3 A(B 1 \ K 1 )+A(M 1 ) LW LW + LW = LW = 486 LW = 1LW Hence, A(B 1 ) = A(B 1 M 1 ) 1 LW, and all remaining items can be packed into the second bin. (β) Let A(M 1 ) < 1 LW, then 54 A(M ) = A(K) A(K ) A(B 1 ) A(M 1 ) > LW ( LW + LW ) LW LW = LW = 3 LW. Because of this and l iw i 9 L1W = 8 LW for all i M, the set M contains at least three items. Pack three items of M side by side
13 T, Buchwald, G. Scheithauer. August 3, on the top of the first bin (Fig. 3). Because of w i < W for all i M 9 there exist a unused area of size L 4W. We show that there exists a set Ǩ 9 1 K 1 \ ( K 1 M ) with A( K 1 M Ǩ1) 1 LW that can be packed into this unused area. Let M = {1,..., m} := K 1 \ ( K 1 M ). So we have A( M) = A(K 1 \ ( K 1 M )) = A(K 1 ) A( K 1 ) A(M ) ( )LW = LW = 19 LW > 1LW. Let j M denote the smallest index with j i=1 l iw i 1 j LW. Because of the sorting one obtains 9 i=1 l iw i LW. Hence, 9 these items can be packed in the unused area and we obtain A(B 1 ) 175 LW LW LW = LW = 833 LW > 1 LW. Due to Steinberg s theorem all remaining items can be packed into the second bin. Figure 3: Packing of items of K 1 and M (B) Let l( K 1 ) < 7 L. 9 Because of construction of K 1 it holds that l i > L i K 9 1 since otherwise a further item of K 1 could be packed besides the items of K 1. Empty again the first bin (i.e. B 1 = ), and pack items of K 1 using the FFDW 1 - heuristic, into the bin. If now A(B 1 ) 1 LW then all remaining items can be packed into the second bin. If however A(B 1 ) < 1 LW then, because of Theorem 5, all items of K 1 are packed, i.e. K1 B 1. Let k denote the area-largest item of K 1 \B 1. Because of Theorem 5 and the sorting of items with respect to non-increasing width one has l k < L. We consider two subcases: 9 (α) Let l k w k 1 LW. 54 Empty the first bin and pack items of K 1 \{k} using the FFDH 1 -heuristic into that bin. Let B 1 K 1 \{k} denote those items now packed into the first bin. If A( B 1 ) 1LW then we are done. Otherwise, if A( B 1 ) < 1LW then it holds A( B 1 ) 1 LW 1 LW because of inequality (3). Furthermore, because of Theorem 5, all items 54 of K 1 are packed in the first bin, i.e. K1 B 1. We show that the items B 1 {k} can bepacked into one bin. Empty again the first bin and pack anew items of K 1 along the bottom side of bin one. Since the total width is at most 7 L, item k fits besides the items 9 of K 1. Then, for the total area of not yet packed items of B 1 we have A( B 1 \ K 1 ) 1 LW LW = LW < 1 3 LW. Therefore, these items can be packed into the unused area of size L 3 W (Fig., right). Because of inequality (3), the total area of this packing is A( B 1 )+l k w k 1 LW.
14 1 A note on Relations between capacity utilization and minimal bin number Consequently, all items not packed into the first bin can be packed into the second due to Steinberg s theorem. (β) Let l k w k < 1 LW. 54 Let M be defined similar to above. Now 1 1 LW A(M) LW Empty the first bin and pack items of K 1 \M using the FFDH 1 -heuristic. Let B 1 denote the set of items which are packed now. Then A( B 1 ) 1LW 1 LW. If A( B 54 1 ) < 1LW, empty again the first bin and pack items of K 1 side by side along the bottom of the first bin. Then A( B 1 \ K 1 )+A(M) 1 5 LW LW LW = LW = 33 LW < 1LW Hence, all these items can be packed into the first bin, and we have A(B 1 ) = A(( B 1 M) 1 LW. Therefore, all remaining non yet packed items fit in the second bin. Case 4: LetA(K 1 ) > 1 LW and A(K ) > 1 LW. Because of A(K) = A(K 1 ) + A(K ) > 1 LW + 1 LW = LW the knapsack condition A(K) LW is violated. Consequently, this case cannot occur. 4 Conclusions and outlook Let be given positive integers p and q, bins of size L W and a set K of rectangles with l i L/p, w i W/q for all i K and A(K) LW. In [HS1] it is shown if p = q = 1 then all items can be packed into at most three bins, and if p = q = 3 at most two bins are needed. These bounds are tight. In this paper, we show that only two bins are needed in case of p =,q = 3, or vice verse. Moreover, we give worst-case instances for p = 1 and q Z + where three bins are needed. There is still a lack between these statements: the case p = q = is still open, which will be part of future research. References [CGJT80] E. G. Coffman, M. R. Garey, D. S. Johnson, and R. E. Tarjan. Performance bounds for level oriented two dimensional packing algorithms. SIAM J. on Computing, 9(4):808 86, [HS1] [Ste97] K. Hoffmann and G. Scheithauer. Relations between capacity utilization and minimal bin number. Preprint MATH-NM-03-01, Technische Universität Dresden, 01. A. Steinberg. A strip-packing algorithm with absolute performance bound. SIAM J. on Computing, 6(): , 1997.
Offline First Fit Scheduling of Power Demands in Smart Grids
Offline First Fit Scheduling of Power Demands in Smart Grids Anshu Ranjan Pramod Khargonekar Sartaj Sahni Abstract In this paper we consider the problem of scheduling energy consumption loads in the setting
More informationIntroduction to Bin Packing Problems
Introduction to Bin Packing Problems Fabio Furini March 13, 2015 Outline Origins and applications Applications: Definition: Bin Packing Problem (BPP) Solution techniques for the BPP Heuristic Algorithms
More informationConservative scales in packing problems
Als Manuskript gedruckt Technische Universität Dresden Herausgeber: Der Rektor Conservative scales in packing problems G. Belov, V. M. Kartak, H. Rohling, G. Scheithauer MATH-NM-03-2011 August 4, 2011
More informationarxiv: v1 [math.oc] 3 Jan 2019
The Product Knapsack Problem: Approximation and Complexity arxiv:1901.00695v1 [math.oc] 3 Jan 2019 Ulrich Pferschy a, Joachim Schauer a, Clemens Thielen b a Department of Statistics and Operations Research,
More informationA BRANCH&BOUND ALGORITHM FOR SOLVING ONE-DIMENSIONAL CUTTING STOCK PROBLEMS EXACTLY
APPLICATIONES MATHEMATICAE 23,2 (1995), pp. 151 167 G. SCHEITHAUER and J. TERNO (Dresden) A BRANCH&BOUND ALGORITHM FOR SOLVING ONE-DIMENSIONAL CUTTING STOCK PROBLEMS EXACTLY Abstract. Many numerical computations
More informationTechnische Universität Dresden Herausgeber: Der Rektor
Als Manuskript gedruckt Technische Universität Dresden Herausgeber: Der Rektor Models with Variable Strip Widths for Two-Dimensional Two-Stage Cutting G. Belov, G. Scheithauer MATH-NM-17-2003 October 8,
More informationDiscrete Applied Mathematics. Tighter bounds of the First Fit algorithm for the bin-packing problem
Discrete Applied Mathematics 158 (010) 1668 1675 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Tighter bounds of the First Fit algorithm
More informationOn Two Class-Constrained Versions of the Multiple Knapsack Problem
On Two Class-Constrained Versions of the Multiple Knapsack Problem Hadas Shachnai Tami Tamir Department of Computer Science The Technion, Haifa 32000, Israel Abstract We study two variants of the classic
More informationThe effect of machine availability on the worst-case performance of LPT
Discrete Applied Mathematics 148 (2005) 49 61 www.elsevier.com/locate/dam The effect of machine availability on the worst-case performance of LPT Hark-Chin Hwang a, Kangbok Lee b, Soo Y. Chang b a Department
More informationOptimal Online Algorithms for Multidimensional Packing Problems
Optimal Online Algorithms for Multidimensional Packing Problems Leah Epstein Rob van Stee Abstract We solve an open problem in the literature by providing an online algorithm for multidimensional bin packing
More informationBIN PACKING IN MULTIPLE DIMENSIONS: INAPPROXIMABILITY RESULTS AND APPROXIMATION SCHEMES
BIN PACKING IN MULTIPLE DIMENSIONS: INAPPROXIMABILITY RESULTS AND APPROXIMATION SCHEMES NIKHIL BANSAL 1, JOSÉ R. CORREA2, CLAIRE KENYON 3, AND MAXIM SVIRIDENKO 1 1 IBM T.J. Watson Research Center, Yorktown
More informationarxiv:cs/ v2 [cs.ds] 23 Aug 2006
Strip Packing vs. Bin Packing arxiv:cs/0607046v2 [cs.ds] 23 Aug 2006 Xin Han 1 Kazuo Iwama 1 Deshi Ye 2 Guochuan Zhang 3 1 School of Informatics, Kyoto University, Kyoto 606-8501, Japan {hanxin, iwama}@kuis.kyoto-u.ac.jp
More informationMat 3770 Bin Packing or
Basic Algithm Spring 2014 Used when a problem can be partitioned into non independent sub problems Basic Algithm Solve each sub problem once; solution is saved f use in other sub problems Combine solutions
More information8 Knapsack Problem 8.1 (Knapsack)
8 Knapsack In Chapter 1 we mentioned that some NP-hard optimization problems allow approximability to any required degree. In this chapter, we will formalize this notion and will show that the knapsack
More informationCentre d Economie de la Sorbonne UMR 8174
Centre d Economie de la Sorbonne UMR 8174 On-line bin-packing problem : maximizing the number of unused bins Bernard KOUAKOU Marc DEMANGE Eric SOUTIF 2006.38 Maison des Sciences Économiques, 106-112 boulevard
More informationApproximation Algorithms for the Incremental Knapsack Problem via Disjunctive Programming
Approximation Algorithms for the Incremental Knapsack Problem via Disjunctive Programming Daniel Bienstock, Jay Sethuraman, Chun Ye Department of Industrial Engineering and Operations Research Columbia
More informationTheoretical Computer Science
Theoretical Computer Science 411 (010) 417 44 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: wwwelseviercom/locate/tcs Resource allocation with time intervals
More informationOnline Removable Square Packing
Online Removable Square Packing Xin Han 1 Kazuo Iwama 1 Guochuan Zhang 2 1 School of Informatics, Kyoto University, Kyoto 606-8501, Japan, {hanxin, iwama}@kuis.kyoto-u.ac.jp, 2 Department of Mathematics,
More informationINSTITUT FÜR INFORMATIK
INSTITUT FÜR INFORMATIK Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2 Klaus Jansen and Ralf Thöle Bericht Nr. 0808 September 2008 CHRISTIAN-ALBRECHTS-UNIVERSITÄT
More informationA Robust APTAS for the Classical Bin Packing Problem
A Robust APTAS for the Classical Bin Packing Problem Leah Epstein 1 and Asaf Levin 2 1 Department of Mathematics, University of Haifa, 31905 Haifa, Israel. Email: lea@math.haifa.ac.il 2 Department of Statistics,
More informationKnapsack and Scheduling Problems. The Greedy Method
The Greedy Method: Knapsack and Scheduling Problems The Greedy Method 1 Outline and Reading Task Scheduling Fractional Knapsack Problem The Greedy Method 2 Elements of Greedy Strategy An greedy algorithm
More informationColored Bin Packing: Online Algorithms and Lower Bounds
Noname manuscript No. (will be inserted by the editor) Colored Bin Packing: Online Algorithms and Lower Bounds Martin Böhm György Dósa Leah Epstein Jiří Sgall Pavel Veselý Received: date / Accepted: date
More informationHomework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4
Do the following exercises from the text: Chapter (Section 3):, 1, 17(a)-(b), 3 Prove that 1 3 + 3 + + n 3 n (n + 1) for all n N Proof The proof is by induction on n For n N, let S(n) be the statement
More informationarxiv: v1 [cs.ds] 11 Dec 2013
WORST-CASE PERFORMANCE ANALYSIS OF SOME APPROXIMATION ALGORITHMS FOR MINIMIZING MAKESPAN AND FLOW-TIME PERUVEMBA SUNDARAM RAVI, LEVENT TUNÇEL, MICHAEL HUANG arxiv:1312.3345v1 [cs.ds] 11 Dec 2013 Abstract.
More informationCS 6901 (Applied Algorithms) Lecture 3
CS 6901 (Applied Algorithms) Lecture 3 Antonina Kolokolova September 16, 2014 1 Representative problems: brief overview In this lecture we will look at several problems which, although look somewhat similar
More informationMarvin L. Sahs Mathematics Department, Illinois State University, Normal, Illinois Papa A. Sissokho.
#A70 INTEGERS 13 (2013) A ZERO-SUM THEOREM OVER Z Marvin L. Sahs Mathematics Department, Illinois State University, Normal, Illinois marvinsahs@gmail.com Papa A. Sissokho Mathematics Department, Illinois
More informationOne-Dimensional Relaxations and LP Bounds for Orthogonal Packing
Als Manuskript gedruckt Technische Universität Dresden Herausgeber: Der Rektor One-Dimensional Relaxations and LP Bounds for Orthogonal Packing G. Belov, V. Kartak, H. Rohling, G. Scheithauer MATH-NM-03-2009
More informationThis means that we can assume each list ) is
This means that we can assume each list ) is of the form ),, ( )with < and Since the sizes of the items are integers, there are at most +1pairs in each list Furthermore, if we let = be the maximum possible
More informationMATH 409 Advanced Calculus I Lecture 7: Monotone sequences. The Bolzano-Weierstrass theorem.
MATH 409 Advanced Calculus I Lecture 7: Monotone sequences. The Bolzano-Weierstrass theorem. Limit of a sequence Definition. Sequence {x n } of real numbers is said to converge to a real number a if for
More informationOn-line Scheduling of Two Parallel Machines. with a Single Server
On-line Scheduling of Two Parallel Machines with a Single Server Lele Zhang, Andrew Wirth Department of Mechanical and Manufacturing Engineering, The University of Melbourne, VIC 3010, Australia Abstract
More informationAn analysis of the LPT algorithm for the max min and the min ratio partition problems
Theoretical Computer Science 349 (2005) 407 419 www.elsevier.com/locate/tcs An analysis of the LPT algorithm for the max min and the min ratio partition problems Bang Ye Wu Department of Computer Science
More informationA robust APTAS for the classical bin packing problem
A robust APTAS for the classical bin packing problem Leah Epstein Asaf Levin Abstract Bin packing is a well studied problem which has many applications. In this paper we design a robust APTAS for the problem.
More informationLinear Classification: Linear Programming
Linear Classification: Linear Programming Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong 1 / 21 Y Tao Linear Classification: Linear Programming Recall the definition
More informationApproximation Algorithms for Orthogonal Packing Problems for Hypercubes
Approximation Algorithms for Orthogonal Packing Problems for Hypercubes Rolf Harren 1 Max-Planck-Institut für Informatik, Campus E 1 4, 66123 Saarbrücken, Germany Abstract Orthogonal packing problems are
More informationOn-line Bin-Stretching. Yossi Azar y Oded Regev z. Abstract. We are given a sequence of items that can be packed into m unit size bins.
On-line Bin-Stretching Yossi Azar y Oded Regev z Abstract We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try
More informationThe Modified Integer Round-Up Property of the One-Dimensional Cutting Stock Problem
EJOR 84 (1995) 562 571 The Modified Integer Round-Up Property of the One-Dimensional Cutting Stock Problem Guntram Scheithauer and Johannes Terno Institute of Numerical Mathematics, Dresden University
More informationMachine scheduling with resource dependent processing times
Mathematical Programming manuscript No. (will be inserted by the editor) Alexander Grigoriev Maxim Sviridenko Marc Uetz Machine scheduling with resource dependent processing times Received: date / Revised
More informationMinimizing Mean Flowtime and Makespan on Master-Slave Systems
Minimizing Mean Flowtime and Makespan on Master-Slave Systems Joseph Y-T. Leung,1 and Hairong Zhao 2 Department of Computer Science New Jersey Institute of Technology Newark, NJ 07102, USA Abstract The
More informationKnapsack. Bag/knapsack of integer capacity B n items item i has size s i and profit/weight w i
Knapsack Bag/knapsack of integer capacity B n items item i has size s i and profit/weight w i Goal: find a subset of items of maximum profit such that the item subset fits in the bag Knapsack X: item set
More informationAPPROXIMATION ALGORITHMS FOR PACKING AND SCHEDULING PROBLEMS
APPROXIMATION ALGORITHMS FOR PACKING AND SCHEDULING PROBLEMS Dissertation zur Erlangung des akademischen Grades Doktor der Naturwissenschaften (Dr. rer. nat.) der Technischen Fakultät der Christian-Albrechts-Universität
More informationBackward and Forward Bisimulation Minimisation of Tree Automata
Backward and Forward Bisimulation Minimisation of Tree Automata Johanna Högberg Department of Computing Science Umeå University, S 90187 Umeå, Sweden Andreas Maletti Faculty of Computer Science Technische
More informationNetwork Design and Game Theory Spring 2008 Lecture 2
Network Design and Game Theory Spring 2008 Lecture 2 Instructor: Mohammad T. Hajiaghayi Scribe: Imdadullah Khan February 04, 2008 MAXIMUM COVERAGE In this lecture we review Maximum Coverage and Unique
More informationAverage-Case Performance of Rollout Algorithms for Knapsack Problems
Average-Case Performance of Rollout Algorithms for Knapsack Problems Andrew Mastin Patrick Jaillet Abstract Rollout algorithms have demonstrated excellent performance on a variety of dynamic and discrete
More informationLinear Time Selection
Linear Time Selection Given (x,y coordinates of N houses, where should you build road These lecture slides are adapted from CLRS.. Princeton University COS Theory of Algorithms Spring 0 Kevin Wayne Given
More informationarxiv: v1 [cs.dm] 22 Mar 2014
Online Square-into-Square Packing Sándor P. Fekete Hella-Franziska Hoffmann arxiv:03.5665v [cs.dm] Mar 0 Abstract In 967, Moon and Moser proved a tight bound on the critical density of squares in squares:
More informationWe want to show P (n) is true for all integers
Generalized Induction Proof: Let P (n) be the proposition 1 + 2 + 2 2 + + 2 n = 2 n+1 1. We want to show P (n) is true for all integers n 0. Generalized Induction Example: Use generalized induction to
More informationOptimal analysis of Best Fit bin packing
Optimal analysis of Best Fit bin packing György Dósa Jiří Sgall November 2, 2013 Abstract In the bin packing problem we are given an instance consisting of a sequence of items with sizes between 0 and
More informationLinear Classification: Linear Programming
Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong Recall the definition of linear classification. Definition 1. Let R d denote the d-dimensional space where the domain
More informationA Branch-and-Cut Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem
Yongpei Guan 1 Shabbir Ahmed 1 George L. Nemhauser 1 Andrew J. Miller 2 A Branch-and-Cut Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem December 12, 2004 Abstract. This paper addresses a
More informationAn Improved Algorithm for Parameterized Edge Dominating Set Problem
An Improved Algorithm for Parameterized Edge Dominating Set Problem Ken Iwaide and Hiroshi Nagamochi Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Japan,
More informationNew Exact Approaches to Row Layout Problems
New Exact Approaches to Row Layout Problems Anja Fischer, Frank Fischer, Philipp Hungerländer November 3, 015 Abstract. Given a set of departments, a number of rows and pairwise connectivities between
More informationMatchings in hypergraphs of large minimum degree
Matchings in hypergraphs of large minimum degree Daniela Kühn Deryk Osthus Abstract It is well known that every bipartite graph with vertex classes of size n whose minimum degree is at least n/2 contains
More informationCombinatorial optimization problems
Combinatorial optimization problems Heuristic Algorithms Giovanni Righini University of Milan Department of Computer Science (Crema) Optimization In general an optimization problem can be formulated as:
More informationarxiv:cs/ v1 [cs.ds] 20 Dec 2006
Improved results for a memory allocation problem Leah Epstein Rob van Stee August 6, 018 Abstract arxiv:cs/061100v1 [cs.ds] 0 Dec 006 We consider a memory allocation problem that can be modeled as a version
More informationMinimizing the Number of Tardy Jobs
Minimizing the Number of Tardy Jobs 1 U j Example j p j d j 1 10 10 2 2 11 3 7 13 4 4 15 5 8 20 Ideas: Need to choose a subset of jobs S that meet their deadlines. Schedule the jobs that meet their deadlines
More informationTechnische Universität Dresden Herausgeber: Der Rektor
Als Manuskript gedruckt Technische Universität Dresden Herausgeber: Der Rektor Setup and Open Stacks Minimization in One-Dimensional Stock Cutting G. Belov, G. Scheithauer MATH-NM-16-2003 June 24, 2004
More informationCMSC 451: Lecture 7 Greedy Algorithms for Scheduling Tuesday, Sep 19, 2017
CMSC CMSC : Lecture Greedy Algorithms for Scheduling Tuesday, Sep 9, 0 Reading: Sects.. and. of KT. (Not covered in DPV.) Interval Scheduling: We continue our discussion of greedy algorithms with a number
More informationOnline Interval Coloring and Variants
Online Interval Coloring and Variants Leah Epstein 1, and Meital Levy 1 Department of Mathematics, University of Haifa, 31905 Haifa, Israel. Email: lea@math.haifa.ac.il School of Computer Science, Tel-Aviv
More informationTechnische Universität Dresden Institute of Numerical Mathematics
Technische Universität Dresden Institute of Numerical Mathematics An Improved Flow-based Formulation and Reduction Principles for the Minimum Connectivity Inference Problem Muhammad Abid Dar Andreas Fischer
More informationTechnische Universität Dresden Herausgeber: Der Rektor
Als Manuskript gedruckt Technische Universität Dresden Herausgeber: Der Rektor The Gradient of the Squared Residual as Error Bound an Application to Karush-Kuhn-Tucker Systems Andreas Fischer MATH-NM-13-2002
More informationFundamental Domains for Integer Programs with Symmetries
Fundamental Domains for Integer Programs with Symmetries Eric J. Friedman Cornell University, Ithaca, NY 14850, ejf27@cornell.edu, WWW home page: http://www.people.cornell.edu/pages/ejf27/ Abstract. We
More informationSemi-Online Multiprocessor Scheduling with Given Total Processing Time
Semi-Online Multiprocessor Scheduling with Given Total Processing Time T.C. Edwin Cheng Hans Kellerer Vladimir Kotov Abstract We are given a set of identical machines and a sequence of jobs, the sum of
More informationMAX for k-independence in multigraphs
MAX for k-independence in multigraphs Nevena Francetić Sara Herke Daniel Horsley arxiv:1807.04997v1 [math.co] 13 Jul 2018 Abstract For a fixed positive integer k, a set S of vertices of a graph or multigraph
More informationMachine Minimization for Scheduling Jobs with Interval Constraints
Machine Minimization for Scheduling Jobs with Interval Constraints Julia Chuzhoy Sudipto Guha Sanjeev Khanna Joseph (Seffi) Naor Abstract The problem of scheduling jobs with interval constraints is a well-studied
More informationAPTAS for Bin Packing
APTAS for Bin Packing Bin Packing has an asymptotic PTAS (APTAS) [de la Vega and Leuker, 1980] For every fixed ε > 0 algorithm outputs a solution of size (1+ε)OPT + 1 in time polynomial in n APTAS for
More informationThe Maximum Flow Problem with Disjunctive Constraints
The Maximum Flow Problem with Disjunctive Constraints Ulrich Pferschy Joachim Schauer Abstract We study the maximum flow problem subject to binary disjunctive constraints in a directed graph: A negative
More informationA Θ(n) Approximation Algorithm for 2-Dimensional Vector Packing
A Θ(n) Approximation Algorithm for 2-Dimensional Vector Packing Ekow Otoo a, Ali Pinar b,, Doron Rotem a a Lawrence Berkeley National Laboratory b Sandia National Laboratories Abstract We study the 2-dimensional
More information13 Dynamic Programming (3) Optimal Binary Search Trees Subset Sums & Knapsacks
13 Dynamic Programming (3) Optimal Binary Search Trees Subset Sums & Knapsacks Average-case analysis Average-case analysis of algorithms and data structures: Input is generated according to a known probability
More information(a) Write a greedy O(n log n) algorithm that, on input S, returns a covering subset C of minimum size.
Esercizi su Greedy Exercise 1.1 Let S = {[a 1, b 1 ], [a 2, b 2 ],..., [a n, b n ]} be a set of closed intervals on the real line. We say that C S is a covering subset for S if, for any interval [a, b]
More informationA new analysis of Best Fit bin packing
A new analysis of Best Fit bin packing Jiří Sgall Computer Science Institute of Charles University, Prague, Czech Republic. sgall@iuuk.mff.cuni.cz Abstract. We give a simple proof and a generalization
More informationChain Independence and Common Information
1 Chain Independence and Common Information Konstantin Makarychev and Yury Makarychev Abstract We present a new proof of a celebrated result of Gács and Körner that the common information is far less than
More information1 Matroid intersection
CS 369P: Polyhedral techniques in combinatorial optimization Instructor: Jan Vondrák Lecture date: October 21st, 2010 Scribe: Bernd Bandemer 1 Matroid intersection Given two matroids M 1 = (E, I 1 ) and
More information0-1 Knapsack Problem
KP-0 0-1 Knapsack Problem Define object o i with profit p i > 0 and weight w i > 0, for 1 i n. Given n objects and a knapsack capacity C > 0, the problem is to select a subset of objects with largest total
More informationDiskrete Mathematik Solution 6
ETH Zürich, D-INFK HS 2018, 30. October 2018 Prof. Ueli Maurer Marta Mularczyk Diskrete Mathematik Solution 6 6.1 Partial Order Relations a) i) 11 and 12 are incomparable, since 11 12 and 12 11. ii) 4
More information1 Column Generation and the Cutting Stock Problem
1 Column Generation and the Cutting Stock Problem In the linear programming approach to the traveling salesman problem we used the cutting plane approach. The cutting plane approach is appropriate when
More informationK-center Hardness and Max-Coverage (Greedy)
IOE 691: Approximation Algorithms Date: 01/11/2017 Lecture Notes: -center Hardness and Max-Coverage (Greedy) Instructor: Viswanath Nagarajan Scribe: Sentao Miao 1 Overview In this lecture, we will talk
More informationHeuristics for Solving the Bin-Packing Problem with Conflicts
Applied Mathematical Sciences, Vol. 5, 0, no. 35, 739-75 Heuristics for Solving the Bin-Packing Problem with Conflicts Mohamed Maiza Applied Mathematics Laboratory, Military Polytechnic School B.P.7 Bordj-El-Bahri,
More information2.2 Some Consequences of the Completeness Axiom
60 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.2 Some Consequences of the Completeness Axiom In this section, we use the fact that R is complete to establish some important results. First, we will prove that
More informationTight Approximation for Scheduling Parallel Job on Identical Clusters
Tight Approximation for Scheduling Parallel Job on Identical Clusters Marin Bougeret, Pierre-Francois Dutot, Denis Trystram, Klaus Jansen, Christina Robenek To cite this version: Marin Bougeret, Pierre-Francois
More informationCHAPTER 8: EXPLORING R
CHAPTER 8: EXPLORING R LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN In the previous chapter we discussed the need for a complete ordered field. The field Q is not complete, so we constructed
More information#A45 INTEGERS 9 (2009), BALANCED SUBSET SUMS IN DENSE SETS OF INTEGERS. Gyula Károlyi 1. H 1117, Hungary
#A45 INTEGERS 9 (2009, 591-603 BALANCED SUBSET SUMS IN DENSE SETS OF INTEGERS Gyula Károlyi 1 Institute of Mathematics, Eötvös University, Pázmány P. sétány 1/C, Budapest, H 1117, Hungary karolyi@cs.elte.hu
More informationA Node-Flow Model for 1D Stock Cutting: Robust Branch-Cut-and-Price
A Node-Flow Model for 1D Stock Cutting: Robust Branch-Cut-and-Price Gleb Belov University of Dresden Adam N. Letchford Lancaster University Eduardo Uchoa Universidade Federal Fluminense August 4, 2011
More informationOnline Coloring of Intervals with Bandwidth
Online Coloring of Intervals with Bandwidth Udo Adamy 1 and Thomas Erlebach 2, 1 Institute for Theoretical Computer Science, ETH Zürich, 8092 Zürich, Switzerland. adamy@inf.ethz.ch 2 Computer Engineering
More informationTechnische Universität München, Zentrum Mathematik Lehrstuhl für Angewandte Geometrie und Diskrete Mathematik. Combinatorial Optimization (MA 4502)
Technische Universität München, Zentrum Mathematik Lehrstuhl für Angewandte Geometrie und Diskrete Mathematik Combinatorial Optimization (MA 4502) Dr. Michael Ritter Problem Sheet 1 Homework Problems Exercise
More informationCSE541 Class 22. Jeremy Buhler. November 22, Today: how to generalize some well-known approximation results
CSE541 Class 22 Jeremy Buhler November 22, 2016 Today: how to generalize some well-known approximation results 1 Intuition: Behavior of Functions Consider a real-valued function gz) on integers or reals).
More informationILP Formulations for the Lazy Bureaucrat Problem
the the PSL, Université Paris-Dauphine, 75775 Paris Cedex 16, France, CNRS, LAMSADE UMR 7243 Department of Statistics and Operations Research, University of Vienna, Vienna, Austria EURO 2015, 12-15 July,
More informationOnline Algorithms for 1-Space Bounded Multi Dimensional Bin Packing and Hypercube Packing
Online Algorithms for -Space Bounded Multi Dimensional Bin Pacing and Hypercube Pacing Yong Zhang Francis Y.L. Chin Hing-Fung Ting Xin Han Abstract In this paper, we study -space bounded multi-dimensional
More informationOn the Chvatál-Complexity of Binary Knapsack Problems. Gergely Kovács 1 Béla Vizvári College for Modern Business Studies, Hungary
On the Chvatál-Complexity of Binary Knapsack Problems Gergely Kovács 1 Béla Vizvári 2 1 College for Modern Business Studies, Hungary 2 Eastern Mediterranean University, TRNC 2009. 1 Chvátal Cut and Complexity
More informationa i,1 a i,j a i,m be vectors with positive entries. The linear programming problem associated to A, b and c is to find all vectors sa b
LINEAR PROGRAMMING PROBLEMS MATH 210 NOTES 1. Statement of linear programming problems Suppose n, m 1 are integers and that A = a 1,1... a 1,m a i,1 a i,j a i,m a n,1... a n,m is an n m matrix of positive
More information5 Flows and cuts in digraphs
5 Flows and cuts in digraphs Recall that a digraph or network is a pair G = (V, E) where V is a set and E is a multiset of ordered pairs of elements of V, which we refer to as arcs. Note that two vertices
More informationCOMPLETION OF PARTIAL LATIN SQUARES
COMPLETION OF PARTIAL LATIN SQUARES Benjamin Andrew Burton Honours Thesis Department of Mathematics The University of Queensland Supervisor: Dr Diane Donovan Submitted in 1996 Author s archive version
More information3.4 Relaxations and bounds
3.4 Relaxations and bounds Consider a generic Discrete Optimization problem z = min{c(x) : x X} with an optimal solution x X. In general, the algorithms generate not only a decreasing sequence of upper
More informationAbout the gap between the optimal values of the integer and continuous relaxation one-dimensional cutting stock problem
Operations Research Proceedings 1991, Springer-Verlag Berlin Heidelberg (1992) 439 444 About the gap between the optimal values of the integer and continuous relaxation one-dimensional cutting stock problem
More informationDEPTH OF FACTORS OF SQUARE FREE MONOMIAL IDEALS
DEPTH OF FACTORS OF SQUARE FREE MONOMIAL IDEALS DORIN POPESCU Abstract. Let I be an ideal of a polynomial algebra over a field, generated by r-square free monomials of degree d. If r is bigger (or equal)
More informationMaths 212: Homework Solutions
Maths 212: Homework Solutions 1. The definition of A ensures that x π for all x A, so π is an upper bound of A. To show it is the least upper bound, suppose x < π and consider two cases. If x < 1, then
More informationOptimal Folding Of Bit Sliced Stacks+
Optimal Folding Of Bit Sliced Stacks+ Doowon Paik University of Minnesota Sartaj Sahni University of Florida Abstract We develop fast polynomial time algorithms to optimally fold stacked bit sliced architectures
More informationAsymptotic Polynomial-Time Approximation (APTAS) and Randomized Approximation Algorithms
Approximation Algorithms Asymptotic Polynomial-Time Approximation (APTAS) and Randomized Approximation Algorithms Jens Egeblad November 29th, 2006 Agenda First lesson (Asymptotic Approximation): Bin-Packing
More informationON KRONECKER PRODUCTS OF CHARACTERS OF THE SYMMETRIC GROUPS WITH FEW COMPONENTS
ON KRONECKER PRODUCTS OF CHARACTERS OF THE SYMMETRIC GROUPS WITH FEW COMPONENTS C. BESSENRODT AND S. VAN WILLIGENBURG Abstract. Confirming a conjecture made by Bessenrodt and Kleshchev in 1999, we classify
More informationMarketing Impact on Diffusion in Social Networks
Marketing Impact on Diffusion in Social Networks Pavel Naumov Vassar College, Poughkeepsie, New York, USA Jia Tao The College of New Jersey, Ewing, New Jersey, USA Abstract The article proposes a way to
More informationA Linear Time Algorithm for Ordered Partition
A Linear Time Algorithm for Ordered Partition Yijie Han School of Computing and Engineering University of Missouri at Kansas City Kansas City, Missouri 64 hanyij@umkc.edu Abstract. We present a deterministic
More information