Approximation and online algorithms for multidimensional bin packing: A survey

The bin packing problem is a well-studied problem in combinatorial optimization. In the classical bin packing problem, we are given a list of real numbers in (0,1] and the goal is to place them in a minimum number of bins so that no bin holds numbers summing to more than 1. The problem is extremely...

Full description

Saved in:
Bibliographic Details
Published in:Computer science review Vol. 24; pp. 63 - 79
Main Authors: Christensen, Henrik I., Khan, Arindam, Pokutta, Sebastian, Tetali, Prasad
Format: Journal Article
Language:English
Published: Elsevier Inc 01.05.2017
Subjects:
Approximation algorithms
Bin packing
Geometric packing
Multidimensional packing and covering
Multidimensional scheduling
Online algorithms
Bin packing
Online algorithms
Approximation algorithms
Multidimensional packing and covering
Multidimensional scheduling
Geometric packing
ISSN:1574-0137, 1876-7745
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract The bin packing problem is a well-studied problem in combinatorial optimization. In the classical bin packing problem, we are given a list of real numbers in (0,1] and the goal is to place them in a minimum number of bins so that no bin holds numbers summing to more than 1. The problem is extremely important in practice and finds numerous applications in scheduling, routing and resource allocation problems. Theoretically the problem has rich connections with discrepancy theory, iterative methods, entropy rounding and has led to the development of several algorithmic techniques. In this survey we consider approximation and online algorithms for several classical generalizations of bin packing problem such as geometric bin packing, vector bin packing and various other related problems. There is also a vast literature on mathematical models and exact algorithms for bin packing. However, this survey does not address such exact algorithms. In two-dimensional geometric bin packing, we are given a collection of rectangular items to be packed into a minimum number of unit size square bins. This variant has a lot of applications in cutting stock, vehicle loading, pallet packing, memory allocation and several other logistics and robotics related problems. In d-dimensional vector bin packing, each item is a d-dimensional vector that needs to be packed into unit vector bins. This problem is of great significance in resource constrained scheduling and in recent virtual machine placement in cloud computing. We also consider several other generalizations of bin packing such as geometric knapsack, strip packing and other related problems such as vector scheduling, vector covering etc. We survey algorithms for these problems in offline and online setting, and also mention results for several important special cases. We briefly mention related techniques used in the design and analysis of these algorithms. In the end we conclude with a list of open problems.
AbstractList The bin packing problem is a well-studied problem in combinatorial optimization. In the classical bin packing problem, we are given a list of real numbers in (0,1] and the goal is to place them in a minimum number of bins so that no bin holds numbers summing to more than 1. The problem is extremely important in practice and finds numerous applications in scheduling, routing and resource allocation problems. Theoretically the problem has rich connections with discrepancy theory, iterative methods, entropy rounding and has led to the development of several algorithmic techniques. In this survey we consider approximation and online algorithms for several classical generalizations of bin packing problem such as geometric bin packing, vector bin packing and various other related problems. There is also a vast literature on mathematical models and exact algorithms for bin packing. However, this survey does not address such exact algorithms. In two-dimensional geometric bin packing, we are given a collection of rectangular items to be packed into a minimum number of unit size square bins. This variant has a lot of applications in cutting stock, vehicle loading, pallet packing, memory allocation and several other logistics and robotics related problems. In d-dimensional vector bin packing, each item is a d-dimensional vector that needs to be packed into unit vector bins. This problem is of great significance in resource constrained scheduling and in recent virtual machine placement in cloud computing. We also consider several other generalizations of bin packing such as geometric knapsack, strip packing and other related problems such as vector scheduling, vector covering etc. We survey algorithms for these problems in offline and online setting, and also mention results for several important special cases. We briefly mention related techniques used in the design and analysis of these algorithms. In the end we conclude with a list of open problems.
Author Tetali, Prasad
Khan, Arindam
Pokutta, Sebastian
Christensen, Henrik I.
Author_xml – sequence: 1
  givenname: Henrik I.
  surname: Christensen
  fullname: Christensen, Henrik I.
  email: hichristensen@ucsd.edu
  organization: University of California, San Diego, USA
– sequence: 2
  givenname: Arindam
  orcidid: 0000-0001-7505-1687
  surname: Khan
  fullname: Khan, Arindam
  email: arindam.khan@supsi.ch
  organization: Istituto Dalle Molle di studi sull’Intelligenza Artificiale (IDSIA), Scuola universitaria professionale della Svizzera italiana (SUPSI), Università della Svizzera italiana (USI), Switzerland
– sequence: 3
  givenname: Sebastian
  surname: Pokutta
  fullname: Pokutta, Sebastian
  email: sebastian.pokutta@isye.gatech.edu
  organization: Georgia Institute of Technology, Atlanta, USA
– sequence: 4
  givenname: Prasad
  surname: Tetali
  fullname: Tetali, Prasad
  email: tetali@math.gatech.edu
  organization: Georgia Institute of Technology, Atlanta, USA
BookMark eNqFkMtOwzAQRS1UJNrCH7DwDyTYSZykXSBVFS-pgg2sLT_GxSWxKzut6N_jUlYsYDUz0tzRnDNBI-cdIHRNSU4JrW82ufIxwD4v0pTTIieEnqExbZs6a5qKjVLPmiojtGwu0CTGDSENIaweo-fFdhv8p-3FYL3DwmnsXWcdYNGtfbDDex-x8QH3u26w2vbgYloUHZbW4a1QH9at53iB4y7s4XCJzo3oIlz91Cl6u797XT5mq5eHp-VilamS1EMGrUmvCKY0K2TFgMxkWxpjyhZkYSQIqkFKXTbVrBVVC4Vi1BAtKihK0zJZTlF1uquCjwnd8G1IDOHAKeFHJ3zDT0740QmnBU9OUmz-K6bs8E0-BGG7_8K3pzAksL2FwKOy4BRoG0ANXHv794EvgUqEug
CitedBy_id crossref_primary_10_1016_j_physa_2019_122024
crossref_primary_10_1007_s00453_022_01078_9
crossref_primary_10_1145_3473713
crossref_primary_10_1007_s11390_018_1876_6
crossref_primary_10_1109_TNET_2024_3424337
crossref_primary_10_1007_s10878_024_01239_2
crossref_primary_10_1016_j_aei_2025_103572
crossref_primary_10_1109_ACCESS_2025_3547623
crossref_primary_10_1016_j_jpdc_2023_104776
crossref_primary_10_1016_j_asoc_2024_111890
crossref_primary_10_1016_j_ifacol_2022_10_097
crossref_primary_10_1007_s00453_021_00801_2
crossref_primary_10_1016_j_cor_2022_106014
crossref_primary_10_1016_j_simpat_2021_102485
crossref_primary_10_3390_ijgi10120798
crossref_primary_10_1287_inte_2021_1086
crossref_primary_10_1016_j_jksuci_2021_03_002
crossref_primary_10_1002_cpe_8304
crossref_primary_10_1007_s00453_020_00723_5
crossref_primary_10_1016_j_jclepro_2024_141249
crossref_primary_10_1109_TBDATA_2022_3161925
crossref_primary_10_1016_j_cie_2022_108122
crossref_primary_10_1186_s13677_024_00653_5
crossref_primary_10_1007_s12351_019_00541_w
crossref_primary_10_1007_s10732_024_09525_2
crossref_primary_10_1007_s00453_021_00844_5
crossref_primary_10_1016_j_orl_2023_06_005
crossref_primary_10_1007_s00453_023_01152_w
crossref_primary_10_2139_ssrn_3760861
crossref_primary_10_1109_TAES_2025_3531843
crossref_primary_10_1007_s00454_024_00633_1
crossref_primary_10_3390_s20164448
crossref_primary_10_1016_j_eswa_2024_123515
crossref_primary_10_1007_s00224_019_09944_w
crossref_primary_10_1109_TCC_2020_3001570
crossref_primary_10_1145_3736723
crossref_primary_10_1016_j_eswa_2023_120568
crossref_primary_10_1007_s10732_020_09444_y
crossref_primary_10_1109_TASE_2024_3454821
crossref_primary_10_1007_s11590_020_01657_1
crossref_primary_10_1016_j_procir_2023_06_163
crossref_primary_10_14778_3611540_3611565
crossref_primary_10_1007_s10958_023_06319_y
crossref_primary_10_1111_cgf_142660
crossref_primary_10_1137_21M1457199
crossref_primary_10_1186_s13677_022_00363_w
crossref_primary_10_1016_j_tcs_2019_01_004
crossref_primary_10_1016_j_autcon_2025_106329
crossref_primary_10_1016_j_cie_2021_107115
crossref_primary_10_3390_en18020268
crossref_primary_10_1111_cgf_70108
crossref_primary_10_1111_itor_13236
crossref_primary_10_1016_j_procir_2022_04_028
crossref_primary_10_1016_j_ijpe_2020_107764
crossref_primary_10_1016_j_cor_2021_105692
crossref_primary_10_1016_j_cor_2021_105693
crossref_primary_10_1007_s10107_024_02106_y
crossref_primary_10_1016_j_cor_2024_106760
crossref_primary_10_1109_TASE_2023_3246223
crossref_primary_10_1109_TCC_2020_3026338
crossref_primary_10_1016_j_aei_2022_101621
crossref_primary_10_1007_s10958_022_06151_w
crossref_primary_10_1016_j_knosys_2021_107683
crossref_primary_10_1016_j_asoc_2023_111168
crossref_primary_10_1016_j_suscom_2018_05_011
crossref_primary_10_1371_journal_pone_0282598
crossref_primary_10_1186_s13677_024_00667_z
crossref_primary_10_1007_s00224_019_09910_6
crossref_primary_10_1007_s00224_020_10011_y
crossref_primary_10_1016_j_eswa_2024_123528
crossref_primary_10_1016_j_cie_2018_08_021
crossref_primary_10_1016_j_ipl_2023_106430
crossref_primary_10_1016_j_aei_2023_102028
crossref_primary_10_1007_s00291_021_00628_x
crossref_primary_10_3233_JIFS_201581
crossref_primary_10_1016_j_cor_2024_106860
crossref_primary_10_1007_s12652_022_03759_3
crossref_primary_10_1016_j_ejor_2025_05_019
crossref_primary_10_1109_TASE_2023_3235742
crossref_primary_10_1007_s00453_023_01130_2
crossref_primary_10_1016_j_ipl_2022_106339
crossref_primary_10_1155_2021_6653586
crossref_primary_10_1145_3491042
crossref_primary_10_1007_s40863_022_00301_3
crossref_primary_10_3390_e23050532
crossref_primary_10_1007_s10479_024_05876_y
crossref_primary_10_1016_j_future_2019_01_006
crossref_primary_10_1016_j_jocs_2021_101388
crossref_primary_10_1145_3506703
crossref_primary_10_1134_S1990478924040112
crossref_primary_10_1016_j_peva_2019_102035
crossref_primary_10_1016_j_cor_2022_105826
crossref_primary_10_1016_j_cor_2025_107209
crossref_primary_10_1007_s10107_018_1325_x
crossref_primary_10_3934_math_2025595
crossref_primary_10_1016_j_compchemeng_2020_106817
crossref_primary_10_1007_s10288_017_0356_0
crossref_primary_10_1287_msom_2022_1178
crossref_primary_10_1016_j_cie_2024_110427
crossref_primary_10_1109_ACCESS_2021_3083214
crossref_primary_10_1002_cpe_6346
crossref_primary_10_1007_s10878_024_01221_y
crossref_primary_10_1016_j_ejor_2020_06_050
crossref_primary_10_1111_itor_12740
crossref_primary_10_1016_j_ipl_2024_106552
crossref_primary_10_1016_j_future_2023_05_001
crossref_primary_10_1109_TCC_2025_3528446
crossref_primary_10_1111_itor_13318
crossref_primary_10_1007_s11590_021_01808_y
crossref_primary_10_1145_3061640_3061650
crossref_primary_10_3390_app12136328
crossref_primary_10_1007_s10288_025_00598_8
crossref_primary_10_1007_s00453_023_01116_0
crossref_primary_10_1109_ACCESS_2021_3072164
crossref_primary_10_1016_j_dam_2025_08_011
crossref_primary_10_1145_3600097
crossref_primary_10_1109_JSAC_2019_2895473
Cites_doi 10.4086/toc.2012.v008a006
10.1287/mnsc.17.5.259
10.1145/2000807.2000818
10.1137/S0097539799356265
10.1007/s00236-005-0003-7
10.1137/0219059
10.1109/FOCS.2013.11
10.1007/978-3-662-43948-7_36
10.1109/SFCS.2002.1181973
10.1007/s00453-006-0194-5
10.1137/S0097539797324874
10.1145/3828.3833
10.1016/j.ipl.2010.05.031
10.1137/1.9781611974331.ch102
10.1007/BF01415672
10.1145/7531.7535
10.1287/moor.25.4.645.12118
10.1137/090749451
10.1016/j.tcs.2010.04.021
10.1007/978-3-540-68891-4_13
10.1016/S0196-6774(03)00055-5
10.1287/moor.1040.0112
10.1007/978-3-642-03685-9_14
10.1016/j.tcs.2012.04.017
10.1145/321906.321909
10.1007/s10951-009-0110-3
10.1137/0210042
10.1137/0217033
10.1145/800152.804907
10.1287/moor.1050.0168
10.1016/0196-6774(81)90034-1
10.1080/07408178408974686
10.1007/978-3-642-40328-6_21
10.1137/0203025
10.1007/978-3-540-27810-8_31
10.1137/1.9781611974331.ch103
10.1016/S0020-0190(97)00120-8
10.1016/j.comgeo.2012.04.001
10.1016/j.ic.2016.03.010
10.1137/1.9781611974782.103
10.1016/0167-6377(89)90027-8
10.1007/s10878-007-9125-x
10.1016/S0167-6377(02)00173-6
10.1007/978-3-540-74456-6_11
10.1145/1120582.1120583
10.1137/1.9781611973402.2
10.1016/j.jcss.2012.04.004
10.1145/2261417.2261440
10.1016/0020-0190(92)90223-I
10.1007/978-3-642-97881-4
10.1016/0196-6774(91)90001-F
10.1007/978-3-319-18263-6_5
10.1137/S0097539799361786
10.1016/S0020-0190(97)00179-8
10.1287/moor.20.2.257
10.1016/S0377-2217(02)00123-6
10.1109/FOCS.2012.84
10.1016/0196-6774(92)90058-K
10.1016/0020-0190(80)90121-0
10.1145/800125.804034
10.1137/1.9781611973105.66
10.1016/j.orl.2004.04.004
10.1002/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J
10.1145/258128.258201
10.1016/S0304-3975(01)00410-8
10.1016/S1571-0653(04)00237-9
10.1016/S0304-3975(03)00363-3
10.1137/S0097539705446895
10.1109/ISCC.2015.7405605
10.1007/s10107-004-0548-1
10.1090/dimacs/007/15
10.1137/0209064
10.1016/0020-0190(94)00026-3
10.1016/S0021-9800(68)80047-X
10.1137/1.9781611974331.ch106
10.1007/978-3-642-29116-6_18
10.1007/11602613_103
10.1137/0603007
10.1137/1.9781611973402.61
10.1137/S0097539793255801
10.1016/0166-218X(94)90036-1
10.1137/S1052623499358689
10.1145/2483699.2483704
10.1137/0602019
10.1109/FOCS.2012.23
10.1287/moor.21.2.321
10.1016/j.orl.2005.09.008
10.1007/s11390-008-9170-7
10.1137/1.9781611973068.73
10.1007/s00236-005-0169-z
10.1016/0166-218X(88)90052-2
10.1109/SFCS.2005.10
10.1007/BF02579456
10.1287/opre.9.6.849
10.1016/j.disopt.2009.04.001
10.1007/PL00009203
10.1137/1.9781611974782.66
10.1016/0890-5401(91)90025-W
10.1016/j.tcs.2013.09.007
10.1016/j.disopt.2006.09.001
10.1007/978-3-540-69903-3_28
10.1137/0209062
10.1007/978-3-642-10631-6_10
10.1016/S0167-6377(03)00057-9
10.1007/BF00264439
10.1137/080736831
10.1109/SFCS.1982.61
10.1145/1240233.1240245
10.1109/FOCS.2015.39
10.1016/0377-2217(84)90053-5
10.1137/1.9781611973730.94
10.1016/0925-5273(92)90034-5
10.1137/1.9781611974782.172
10.1287/moor.4.4.339
10.1016/S0377-2217(99)00261-1
10.1145/1060590.1060702
10.1007/s00453-016-0116-0
10.1007/11758471_21
10.1145/2789149.2789167
10.1145/333623.333627
10.1007/978-3-642-03367-4_35
10.1007/s10107-003-0436-0
10.1145/322186.322187
10.1016/0097-3165(76)90001-7
10.1109/SFCS.1991.185444
10.1016/j.disopt.2006.11.005
10.1137/0212033
10.1002/j.1538-7305.1966.tb01709.x
10.1109/ICC.2013.6655233
10.1016/S0167-6377(96)00047-8
10.1016/0743-7315(90)90019-L
10.1145/2488608.2488730
10.1016/0305-0548(94)90059-0
10.1016/0196-6774(84)90004-X
10.1137/1.9781611973082.82
10.1007/s00493-015-3006-1
10.1137/1.9781611973099.32
10.1016/j.tcs.2009.05.033
10.1016/S0304-3975(97)00099-6
10.1016/0167-6377(93)90004-Z
10.1007/s10100-009-0109-z
10.1109/FOCS.2013.50
10.1016/j.comgeo.2013.08.008
10.1137/1.9781611974782.6
10.1109/FOCS.2013.57
10.1145/585265.585269
10.1145/2696081.2696096
10.1016/0196-6774(89)90031-X
10.1137/1.9781611973730.98
ContentType Journal Article
Copyright 2016 Elsevier Inc.
Copyright_xml – notice: 2016 Elsevier Inc.
DBID AAYXX
CITATION
DOI 10.1016/j.cosrev.2016.12.001
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1876-7745
EndPage 79
ExternalDocumentID 10_1016_j_cosrev_2016_12_001
S1574013716301356
GrantInformation_xml – fundername: SNF
  grantid: 200021_159697/1
– fundername: NSF EAGER award
  grantid: CCF-1415496; CCF-1415498
GroupedDBID --K
--M
.~1
0R~
1B1
1~.
1~5
4.4
457
4G.
5GY
5VS
6J9
7-5
71M
8P~
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AARIN
AAXUO
AAYFN
ABBOA
ABFRF
ABJNI
ABMAC
ABUCO
ABXDB
ABYKQ
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADMUD
AEBSH
AEFWE
AEKER
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
APLSM
AXJTR
BKOJK
BLXMC
CS3
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FIRID
FNPLU
FYGXN
GBLVA
GBOLZ
HAMUX
HVGLF
HZ~
IHE
J1W
KOM
M41
MO0
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
PC.
Q38
RIG
ROL
RPZ
SDF
SDG
SES
SPC
SPCBC
SSB
SSD
SSV
SSZ
T5K
UNMZH
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
ID FETCH-LOGICAL-c306t-e8f137a5cd52b45e09b83fff38eb2fbea1debbd37498a48e2c51f0da4e23f85b3
ISICitedReferencesCount 173
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000405622300004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1574-0137
IngestDate Sat Nov 29 07:45:59 EST 2025
Tue Nov 18 21:31:43 EST 2025
Fri Feb 23 02:33:54 EST 2024
IsPeerReviewed false
IsScholarly true
Keywords Bin packing
Online algorithms
Approximation algorithms
Multidimensional packing and covering
Multidimensional scheduling
Geometric packing
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c306t-e8f137a5cd52b45e09b83fff38eb2fbea1debbd37498a48e2c51f0da4e23f85b3
ORCID 0000-0001-7505-1687
PageCount 17
ParticipantIDs crossref_primary_10_1016_j_cosrev_2016_12_001
crossref_citationtrail_10_1016_j_cosrev_2016_12_001
elsevier_sciencedirect_doi_10_1016_j_cosrev_2016_12_001
PublicationCentury 2000
PublicationDate May 2017
2017-05-00
PublicationDateYYYYMMDD 2017-05-01
PublicationDate_xml – month: 05
  year: 2017
  text: May 2017
PublicationDecade 2010
PublicationTitle Computer science review
PublicationYear 2017
Publisher Elsevier Inc
Publisher_xml – name: Elsevier Inc
References Klaus Jansen, Lars Prädel, New approximability results for two-dimensional bin packing, in: SODA, 2013.
Plotkin, Shmoys, Tardos (br000225) 1995; 20
Vazirani (br000145) 2001
Harren, van Stee (br000480) 2012; 15
Klaus Jansen, Roberto Solis-Oba, New approximability results for 2-dimensional packing problems, in: MFCS, 2007, pp. 103–114.
Yossi Azar, Ilan Reuven Cohen, Seny Kamara, Bruce Shepherd, Tight bounds for online vector bin packing, in: STOC, 2013, pp. 961–970.
Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Two for one: Tight approximation of 2D bin packing, in; WADS, 2009, pp. 399–410.
Hochbaum, Shmoys (br000890) 1987; 34
Jansen (br000900) 2010; 24
Li, Cheng (br000690) 1992; 13
Albers (br000965) 1999; 29
Borodin, El-Yaniv (br000060) 2005
Epstein (br000540) 2010; 411
Lawler (br000860) 1979; 4
Magnús M. Halldórsson, Mario Szegedy, Lower bounds for on-line graph coloring, in: SODA, 1992, pp. 211–216.
Zhang (br000475) 2005; 33
Han, Iwama, Ye, Zhang (br000655) 2016
Eilon, Christofides (br000010) 1971; 17
Han, Ye, Zhou (br000570) 2010; 18
Baker, Schwarz (br000645) 1983; 12
Nikhil Bansal, Alberto Caprara, Klaus Jansen, Lars Prädel, Maxim Sviridenko, A structural lemma in 2-dimensional packing, and its implications on approximability, in: ISAAC, 2009, pp. 77–86.
Seiden, Woeginger (br000705) 2005; 102
Arora, Hazan, Kale (br000230) 2012; 8
Varun Gupta, Ana Radovanovic, Online stochastic bin packing, 2012. arXiv preprint
Michel X. Goemans, Thomas Rothvoß, Polynomiality for bin packing with a constant number of item types. in: SODA 2014, 2014, pp. 830–839.
Fereira, Miyazawa, Wakabayashi (br000585) 1998
.
Pinedo (br000880) 2015
Coffman, Garey, Johnson (br000075) 1984
Csirik, Johnson, Kenyon, Orlin, Shor, Weber (br000325) 2006; 53
A. Sebö, G. Shmonin, Proof of the modified integer round-up conjecture for bin packing in dimension 7. Manuscript, 2009.
Seiden (br000290) 2002; 49
Miyazawa, Wakabayashi (br000455) 2004
Walter Kern, Jacob Jan Paulus, A tight analysis of brown-baker-katseff sequences for online strip packing, in: CTW, 2010, pp. 109–110.
Klaus Jansen, Kim-Manuel Klein, About the structure of the integer cone and its application to bin packing, in: SODA, 2017, (in press).
Fleischer, Wahl (br000975) 2000
Leung, Tam, Wong, Young, Chin (br000555) 1990; 10
Anshu Ranjan, Pramod Khargonekar, Sartaj Sahni, Offline first fit scheduling in smart grids, in: IEEE SCC, 2015, pp. 758–763.
van Stee (br000530) 2015; 46
Bansal, Correa, Kenyon, Sviridenko (br000375) 2006; 31
Sungjin Im, Nathaniel Kell, Janardhan Kulkarni, Debmalya Panigrahi, Tight bounds for online vector scheduling, in: FOCS, 2015, pp. 525–544.
Giorgi Nadiradze, Andreas Wiese, On approximating strip packing with a better ratio than 3/2, in: SODA, 2016, pp. 1491–1510.
Alon, Azar, Woeginger, Yadid (br000895) 1998; 1
Rolf Harren, Rob van Stee, Improved absolute approximation ratios for two-dimensional packing problems, in: APPROX-RANDOM, 2009, pp. 177–189.
Dósa, Li, Han, Tuza (br000210) 2013; 510
Fujita, Hada (br000535) 2002; 289
Assmann, Johnson, Kleitman, Leung (br001005) 1984; 5
Hochbaum, Shmoys (br000910) 1988; 17
Jansen, Solis-Oba (br000640) 2009; 6
Csirik, Frenk, Zhang, Labbé (br001015) 1999; 14
Van Vliet (br000525) 1995
Claire Kenyon, Best-fit bin-packing with random order, in: SODA, Vol. 96, 1996, pp. 359–364.
M. Karbasioun, G. Shaikhet, E. Kranakis, I. Lambadaris, Power strip packing of malleable demands in smart grid, in: IEEE International Conference on Communications, 2013, pp. 4261–4265.
Chekuri, Khanna (br000800) 2004; 33
de la Vega, Lueker (br000185) 1981; 1
Kulik, Shachnai (br000400) 2010; 110
Hurink, Paulus (br000675) 2011; 412
Diedrich, Harren, Jansen, Thöle, Thomas (br000765) 2008; 23
Arindam Khan, Mohit Singh, On weighted bipartite edge coloring, in: FSTTCS, 2015, pp. 136–150.
Galambos, Kellerer, Woeginger (br000825) 1993; 11
Nikhil Bansal, Marek Eliás, Arindam Khan, Improved approximation for vector bin packing, in: SODA, 2016, pp. 1561–1579.
Bartal, Fiat, Karloff, Vohra (br000950) 1992
Bansal, Sviridenko (br000590) 2007; 4
Albers (br000160) 2003; 97
Khan (br000355) 2015
Eisenbrand, Pálvölgyi, Rothvoß (br000245) 2013; 9
Nikhil Bansal, Andrea Lodi, Maxim Sviridenko, A tale of two dimensional bin packing, in: FOCS,2005, pp. 657–666.
Coffman, Lueker (br000080) 1991
Boyar, Favrholdt (br000175) 2007; 3
Thomas Rothvoß, The entropy rounding method in approximation algorithms, in: SODA, 2012, pp. 356–372.
Williamson, Shmoys (br000150) 2011
Pietrobuoni (br000715) 2015
Rudin (br000980) 2011
Klaus Jansen, Guochuan Zhang, Maximizing the number of packed rectangles, in: SWAT, 2004, pp. 362–371.
Vincenzo Bonifaci, Andreas Wiese, Scheduling unrelated machines of few different types. CoRR, abs/1205.0974, 2012.
György Dósa, Jiri Sgall, First fit bin packing: A tight analysis, in: STACS 2013, 2013, pp. 538–549.
Todd Gormley, Nicholas Reingold, Eric Torng, Jeffery Westbrook, Generating adversaries for request-answer games, in: SODA, 2000.
Grigoriadis, Khachiyan (br001025) 1996; 21
Bartal, Karloff, Rabani (br000955) 1994; 50
Steven S. Seiden, Rob van Stee, New bounds for multi-dimensional packing, in: SODA, 2002, pp. 486–495.
Grötschel, Lovász, Schrijver (br000220) 1988
Sandy Heydrich, Andreas Wiese, Faster approximation schemes for the two-dimensional knapsack problem, in: SODA, 2017, (in press).
Csirik, Frenk, Galambos, Kan (br001030) 1991; 12
Alberto Caprara, Packing 2-dimensional bins in harmony, in: FOCS, 2002, pp. 490–499.
Dumitrescu, Jiang (br000785) 2014; 45
Brown, Baker, Katseff (br000660) 1982; 18
Ye, Han, Zhang (br000680) 2009; 17
Epstein, Tassa (br000920) 2003; 48
Lee, Lee (br000280) 1985; 32
Gonzalez (br000055) 2007
Bansal, Oosterwijk, Vredeveld, van der Zwaan (br000930) 2016; 76
Scheithauer, Terno (br000235) 1997; 20
Narendra Karmarkar, Richard M. Karp, An efficient approximation scheme for the one-dimensional bin-packing problem, in: FOCS, 1982, pp. 312–320.
Assmann (br001000) 1983
Epstein, Van Stee (br000575) 2007; 4
Coffman, Galambos, Martello, Vigo (br000090) 1999
Caprara, Monaci (br000720) 2004; 32
Epstein, van Stee (br000460) 2005; 35
David R. Karger, Krzysztof Onak, Polynomial approximation schemes for smoothed and random instances of multidimensional packing problems, in: SODA, 2007, pp. 1207–1216.
Rolf Harren, Walter Kern, Improved lower bound for online strip packing - (extended abstract), in: WAOA, 2011, pp. 211–218.
Coppersmith, Raghavan (br000500) 1989; 8
Anna Adamaszek, Andreas Wiese, A quasi-ptas for the two-dimensional geometric knapsack problem, in: SODA, 2015, pp. 1491–1505.
Yossi Azar, Ilan Reuven Cohen, Amos Fiat, Alan Roytman, Packing small vectors, in: SODA, 2016, pp. 1511–1525.
Lodi, Martello, Monaci (br000135) 2002; 141
Caprara, Lodi, Monaci (br000370) 2005; 30
Thomas Rothvoß, Approximating bin packing within o(log opt * log log opt) bins, in: FOCS, 2013, pp. 20–29.
Brian Brubach, Improved bound for online square-into-square packing, in: WAOA, 2014, pp. 47–58.
Harren, Jansen, Prädel, van Stee (br000605) 2014; 47
Aspnes, Azar, Fiat, Plotkin, Waarts (br000985) 1997; 44
Baker, Coffman, Rivest (br000125) 1980; 9
György Dósa, Jirí Sgall, Optimal analysis of best fit bin packing, in: ICALP, 2014, pp. 429–441.
Eisenbrand, Shmonin (br000905) 2006; 34
M.R. Garey, Ronald L. Graham, Jeffrey D. Ullman, Worst-case analysis of memory allocation algorithms, in: STOC, 1972, pp. 143–150.
Ram (br000105) 1992; 28
Rina Panigrahy, Kunal Talwar, Lincoln Uyeda, Udi Wieder, Heuristics for vector bin packing. research. microsoft. com, 2011.
Miroslav Chlebík, Janka Chlebíková, Inapproximability results for orthogonal rectangle packing problems with rotations, in: CIAC, 2006, pp. 199–210.
Caprara, Kellerer, Pferschy, Pisinger (br000870) 2000; 123
Boyar, Larsen, Nielsen (br000170) 2001; 31
Sleator (br000595) 1980; 10
Grigoriadis, Khachiyan, Porkolab, Villavicencio (br000385) 2001; 11
David G. Harris, Aravind Srinivasan, The moser-tardos framework with partial resampling, in: FOCS, 2013, pp. 469–478.
Spieksma (br000120) 1994; 21
Johnson (br000030) 1973
Conway, Maxwell, Miller (br000015) 1971
Epstein (br000425) 2015
Anna Adamaszek, Tomasz Kociumaka, Marcin Pilipczuk, Michal Pilipczuk, Hardness of approximation for strip packing. CoRR, abs/1610.07766, 2016.
Woeginger (br000795) 1997; 64
Epstein (br000830) 2003; 16
Steinberg (br000380) 1997; 26
Peter W. Shor, How to pack better than best fit: tight bounds for average-case online bin packing, in: FOCS, 1991, pp. 752–759.
Johnson, Demers, Ullman, Garey, Graham (br000035) 1974; 3
Rebecca Hoberg, Thomas Rothvoß, A logarithmic additive integrality gap for bin packing, in: SODA, 2017.
Epstein, van Stee (br000565) 2005; 41
Fidaa Abed, Parinya Chalermsook, José R. Correa, Andreas Karrenbauer, Pablo Pérez-Lantero, José A. Soto, Andreas Wiese, On guillotine cutting sequences, in: APPROX, 2015, pp. 1–19.
János Balogh, József Békési, György Dósa, Jirí Sgall, Rob van Stee, The optimal absolute ratio for online bin packing, in: SODA, 2015, pp. 1425–1438.
Nikhil Bansal, Arindam Khan, Improved approximation algorithm for two-dimensional bin packing, in: SODA, 2014, pp. 13–25.
D. Blitz, A. van Vliet, G.J. Woeginger, Lower bounds on the asymptotic worst-case ratio of online bin packing alorithms. Manuscript, 1996.
Jansen, Solis-Oba (br000350) 2003; 306
Faigle, Kern, Turán (br000885) 1989; 9
Keqin, Cheng (br000685) 1990; 19
Gilmore, Gomory (br000005) 1961; 9
Alantha Newman, Ofer Neiman, Aleksandar Nikolov, Beck’s three permutations conjecture: A counterexample and some consequences, in: FOCS, 2012, pp. 253–262.
Csirik, Frenk (br001040) 1990; 1
David de Laat, Frank Vallentin, A breakthrough in sphere packing: The search for magic functions. arXiv preprint
Vredeveld (br000940) 2016
Epstein, Van Stee (br000550) 2006
Kohayakawa, Miyazawa, Raghavan, Wakabayashi (br000560) 2001; 7
Csirik, Woeginger (br000650) 1997; 63
T. Gaizer, An algorithm for the 2D dual bin packing problem. Unpublished manuscript, University of Szeged, Hungary, 1989.
Chandra Chekuri, Jan Vondrák, Rico Zenklusen, Multi-budgeted matchings and matroid intersection via dependent rounding, in: SODA, 2011, pp. 108
Vredeveld (10.1016/j.cosrev.2016.12.001_br000940) 2016
Leung (10.1016/j.cosrev.2016.12.001_br000555) 1990; 10
Chi-Chih Yao (10.1016/j.cosrev.2016.12.001_br000805) 1980; 27
Ullman (10.1016/j.cosrev.2016.12.001_br000020) 1971
Coffman (10.1016/j.cosrev.2016.12.001_br000075) 1984
10.1016/j.cosrev.2016.12.001_br000215
10.1016/j.cosrev.2016.12.001_br000695
10.1016/j.cosrev.2016.12.001_br000330
Jansen (10.1016/j.cosrev.2016.12.001_br000350) 2003; 306
Galambos (10.1016/j.cosrev.2016.12.001_br000825) 1993; 11
Arora (10.1016/j.cosrev.2016.12.001_br000230) 2012; 8
Plotkin (10.1016/j.cosrev.2016.12.001_br000225) 1995; 20
Frieze (10.1016/j.cosrev.2016.12.001_br000395) 1984; 15
Epstein (10.1016/j.cosrev.2016.12.001_br000575) 2007; 4
Eilon (10.1016/j.cosrev.2016.12.001_br000010) 1971; 17
Zhang (10.1016/j.cosrev.2016.12.001_br000475) 2005; 33
Csirik (10.1016/j.cosrev.2016.12.001_br001010) 1988; 21
Schiermeyer (10.1016/j.cosrev.2016.12.001_br000600) 1994
Albers (10.1016/j.cosrev.2016.12.001_br000160) 2003; 97
10.1016/j.cosrev.2016.12.001_br000205
Balogh (10.1016/j.cosrev.2016.12.001_br000300) 2012; 440–441
Csirik (10.1016/j.cosrev.2016.12.001_br001030) 1991; 12
10.1016/j.cosrev.2016.12.001_br000320
Kulik (10.1016/j.cosrev.2016.12.001_br000400) 2010; 110
Bansal (10.1016/j.cosrev.2016.12.001_br000930) 2016; 76
10.1016/j.cosrev.2016.12.001_br000440
10.1016/j.cosrev.2016.12.001_br000470
Assmann (10.1016/j.cosrev.2016.12.001_br001000) 1983
Coffman (10.1016/j.cosrev.2016.12.001_br000100) 2013
Steinberg (10.1016/j.cosrev.2016.12.001_br000380) 1997; 26
Gonzalez (10.1016/j.cosrev.2016.12.001_br000055) 2007
Eisenbrand (10.1016/j.cosrev.2016.12.001_br000905) 2006; 34
Baker (10.1016/j.cosrev.2016.12.001_br000125) 1980; 9
Johnson (10.1016/j.cosrev.2016.12.001_br000030) 1973
Golan (10.1016/j.cosrev.2016.12.001_br000630) 1981; 10
Conway (10.1016/j.cosrev.2016.12.001_br000015) 1971
10.1016/j.cosrev.2016.12.001_br000915
Epstein (10.1016/j.cosrev.2016.12.001_br000920) 2003; 48
Rudin (10.1016/j.cosrev.2016.12.001_br000980) 2011
10.1016/j.cosrev.2016.12.001_br000110
10.1016/j.cosrev.2016.12.001_br000580
Epstein (10.1016/j.cosrev.2016.12.001_br000545) 2003
Scheithauer (10.1016/j.cosrev.2016.12.001_br000235) 1997; 20
Coffman (10.1016/j.cosrev.2016.12.001_br000090) 1999
Assmann (10.1016/j.cosrev.2016.12.001_br001005) 1984; 5
Garey (10.1016/j.cosrev.2016.12.001_br000070) 1981
Johnson (10.1016/j.cosrev.2016.12.001_br000035) 1974; 3
10.1016/j.cosrev.2016.12.001_br000345
Diedrich (10.1016/j.cosrev.2016.12.001_br000765) 2008; 23
Pinedo (10.1016/j.cosrev.2016.12.001_br000880) 2015
10.1016/j.cosrev.2016.12.001_br000465
10.1016/j.cosrev.2016.12.001_br000340
10.1016/j.cosrev.2016.12.001_br000250
Ramanan (10.1016/j.cosrev.2016.12.001_br000285) 1989; 10
Gilmore (10.1016/j.cosrev.2016.12.001_br000005) 1961; 9
10.1016/j.cosrev.2016.12.001_br000490
Borodin (10.1016/j.cosrev.2016.12.001_br000060) 2005
Fujita (10.1016/j.cosrev.2016.12.001_br000535) 2002; 289
Caprara (10.1016/j.cosrev.2016.12.001_br000870) 2000; 123
Caprara (10.1016/j.cosrev.2016.12.001_br000370) 2005; 30
10.1016/j.cosrev.2016.12.001_br000815
10.1016/j.cosrev.2016.12.001_br000935
Hochbaum (10.1016/j.cosrev.2016.12.001_br000890) 1987; 34
Keqin (10.1016/j.cosrev.2016.12.001_br000685) 1990; 19
Aspnes (10.1016/j.cosrev.2016.12.001_br000985) 1997; 44
Baker (10.1016/j.cosrev.2016.12.001_br000200) 1981; 2
Ram (10.1016/j.cosrev.2016.12.001_br000105) 1992; 28
10.1016/j.cosrev.2016.12.001_br000255
10.1016/j.cosrev.2016.12.001_br000495
10.1016/j.cosrev.2016.12.001_br000360
Han (10.1016/j.cosrev.2016.12.001_br000570) 2010; 18
Han (10.1016/j.cosrev.2016.12.001_br000655) 2016
Csirik (10.1016/j.cosrev.2016.12.001_br001015) 1999; 14
Coffman (10.1016/j.cosrev.2016.12.001_br000080) 1991
Kenyon (10.1016/j.cosrev.2016.12.001_br000450) 2000; 25
Grigoriadis (10.1016/j.cosrev.2016.12.001_br000385) 2001; 11
10.1016/j.cosrev.2016.12.001_br000485
Lawler (10.1016/j.cosrev.2016.12.001_br000860) 1979; 4
10.1016/j.cosrev.2016.12.001_br000240
Garey (10.1016/j.cosrev.2016.12.001_br000040) 1979
10.1016/j.cosrev.2016.12.001_br000270
10.1016/j.cosrev.2016.12.001_br000390
Harren (10.1016/j.cosrev.2016.12.001_br000480) 2012; 15
Epstein (10.1016/j.cosrev.2016.12.001_br000565) 2005; 41
Kellerer (10.1016/j.cosrev.2016.12.001_br000865) 2004
Jansen (10.1016/j.cosrev.2016.12.001_br000700) 2014
Csirik (10.1016/j.cosrev.2016.12.001_br000650) 1997; 63
10.1016/j.cosrev.2016.12.001_br000835
10.1016/j.cosrev.2016.12.001_br000710
Dumitrescu (10.1016/j.cosrev.2016.12.001_br000780) 2015; 35
Graham (10.1016/j.cosrev.2016.12.001_br000945) 1966; 45
10.1016/j.cosrev.2016.12.001_br000140
10.1016/j.cosrev.2016.12.001_br000260
van Stee (10.1016/j.cosrev.2016.12.001_br000530) 2015; 46
Jansen (10.1016/j.cosrev.2016.12.001_br000275) 2013; 79
Williamson (10.1016/j.cosrev.2016.12.001_br000150) 2011
Dósa (10.1016/j.cosrev.2016.12.001_br000210) 2013; 510
Jansen (10.1016/j.cosrev.2016.12.001_br000900) 2010; 24
Fleischer (10.1016/j.cosrev.2016.12.001_br000975) 2000
Ye (10.1016/j.cosrev.2016.12.001_br000680) 2009; 17
10.1016/j.cosrev.2016.12.001_br000025
10.1016/j.cosrev.2016.12.001_br000265
Epstein (10.1016/j.cosrev.2016.12.001_br000830) 2003; 16
Li (10.1016/j.cosrev.2016.12.001_br000690) 1992; 13
10.1016/j.cosrev.2016.12.001_br001020
10.1016/j.cosrev.2016.12.001_br000050
Csirik (10.1016/j.cosrev.2016.12.001_br000325) 2006; 53
Grigoriadis (10.1016/j.cosrev.2016.12.001_br001025) 1996; 21
Hochbaum (10.1016/j.cosrev.2016.12.001_br000045) 1996
Bansal (10.1016/j.cosrev.2016.12.001_br000430) 2009; 39
Jansen (10.1016/j.cosrev.2016.12.001_br000725) 2007; 47
Epstein (10.1016/j.cosrev.2016.12.001_br000425) 2015
Coppersmith (10.1016/j.cosrev.2016.12.001_br000500) 1989; 8
10.1016/j.cosrev.2016.12.001_br000615
10.1016/j.cosrev.2016.12.001_br000735
10.1016/j.cosrev.2016.12.001_br000610
10.1016/j.cosrev.2016.12.001_br000730
10.1016/j.cosrev.2016.12.001_br000850
10.1016/j.cosrev.2016.12.001_br000970
van Stee (10.1016/j.cosrev.2016.12.001_br000315) 2012; 43
10.1016/j.cosrev.2016.12.001_br000295
Dumitrescu (10.1016/j.cosrev.2016.12.001_br000785) 2014; 45
Sevast’janov (10.1016/j.cosrev.2016.12.001_br001050) 1994; 55
Lee (10.1016/j.cosrev.2016.12.001_br000280) 1985; 32
10.1016/j.cosrev.2016.12.001_br000845
10.1016/j.cosrev.2016.12.001_br000840
10.1016/j.cosrev.2016.12.001_br000960
10.1016/j.cosrev.2016.12.001_br000165
Harren (10.1016/j.cosrev.2016.12.001_br000605) 2014; 47
10.1016/j.cosrev.2016.12.001_br000195
Eisenbrand (10.1016/j.cosrev.2016.12.001_br000245) 2013; 9
10.1016/j.cosrev.2016.12.001_br000190
Van Vliet (10.1016/j.cosrev.2016.12.001_br000525) 1995
Sarin (10.1016/j.cosrev.2016.12.001_br000115) 1984; 16
Demange (10.1016/j.cosrev.2016.12.001_br000180) 1998; 209
Csirik (10.1016/j.cosrev.2016.12.001_br000095) 1998
10.1016/j.cosrev.2016.12.001_br000755
10.1016/j.cosrev.2016.12.001_br000875
10.1016/j.cosrev.2016.12.001_br000995
Coffman (10.1016/j.cosrev.2016.12.001_br000130) 1980; 9
10.1016/j.cosrev.2016.12.001_br000510
Han (10.1016/j.cosrev.2016.12.001_br000515) 2011; 7
10.1016/j.cosrev.2016.12.001_br000750
10.1016/j.cosrev.2016.12.001_br000990
Galambos (10.1016/j.cosrev.2016.12.001_br000085) 1995; 42
de la Vega (10.1016/j.cosrev.2016.12.001_br000185) 1981; 1
Jansen (10.1016/j.cosrev.2016.12.001_br000640) 2009; 6
Baker (10.1016/j.cosrev.2016.12.001_br000635) 1981; 2
Kohayakawa (10.1016/j.cosrev.2016.12.001_br000560) 2001; 7
Hurink (10.1016/j.cosrev.2016.12.001_br000675) 2011; 412
Alon (10.1016/j.cosrev.2016.12.001_br000895) 1998; 1
Epstein (10.1016/j.cosrev.2016.12.001_br000550) 2006
Meir (10.1016/j.cosrev.2016.12.001_br000365) 1968; 5
van Vliet (10.1016/j.cosrev.2016.12.001_br000305) 1992; 43
10.1016/j.cosrev.2016.12.001_br000625
10.1016/j.cosrev.2016.12.001_br000745
Miyazawa (10.1016/j.cosrev.2016.12.001_br000455) 2004
Hochbaum (10.1016/j.cosrev.2016.12.001_br000910) 1988; 17
10.1016/j.cosrev.2016.12.001_br000620
10.1016/j.cosrev.2016.12.001_br000740
10.1016/j.cosrev.2016.12.001_br001035
Epstein (10.1016/j.cosrev.2016.12.001_br000460) 2005; 35
Grötschel (10.1016/j.cosrev.2016.12.001_br000220) 1988
Faigle (10.1016/j.cosrev.2016.12.001_br000885) 1989; 9
Crescenzi (10.1016/j.cosrev.2016.12.001_br000155) 1991; 93
Epstein (10.1016/j.cosrev.2016.12.001_br000540) 2010; 411
Lodi (10.1016/j.cosrev.2016.12.001_br000135) 2002; 141
10.1016/j.cosrev.2016.12.001_br000415
Albers (10.1016/j.cosrev.2016.12.001_br000965) 1999; 29
10.1016/j.cosrev.2016.12.001_br000410
10.1016/j.cosrev.2016.12.001_br000770
Woeginger (10.1016/j.cosrev.2016.12.001_br000795) 1997; 64
Bansal (10.1016/j.cosrev.2016.12.001_br000375) 2006; 31
Bartal (10.1016/j.cosrev.2016.12.001_br000955) 1994; 50
Chekuri (10.1016/j.cosrev.2016.12.001_br000800) 2004; 33
Khan (10.1016/j.cosrev.2016.12.001_br000355) 2015
Skiena (10.1016/j.cosrev.2016.12.001_br000065) 1999; 30
Alon (10.1016/j.cosrev.2016.12.001_br001045) 1998; 21
10.1016/j.cosrev.2016.12.001_br000405
Caprara (10.1016/j.cosrev.2016.12.001_br000720) 2004; 32
Seiden (10.1016/j.cosrev.2016.12.001_br000290) 2002; 49
Kellerer (10.1016/j.cosrev.2016.12.001_br000810) 2003; 31
Epstein (10.1016/j.cosrev.2016.12.001_br000925) 2006; 42
10.1016/j.cosrev.2016.12.001_br000520
10.1016/j.cosrev.2016.12.001_br000760
Spieksma (10.1016/j.cosrev.2016.12.001_br000120) 1994; 21
Chan (10.1016/j.cosrev.2016.12.001_br000775) 2014; 47
Brown (10.1016/j.cosrev.2016.12.001_br000660) 1982; 18
Sleator (10.1016/j.cosrev.2016.12.001_br000595) 1980; 10
Seiden (10.1016/j.cosrev.2016.12.001_br000705) 2005; 102
Pietrobuoni (10.1016/j.cosrev.2016.12.001_br000715) 2015
Chung (10.1016/j.cosrev.2016.12.001_br000445) 1982; 3
Fereira (10.1016/j.cosrev.2016.12.001_br000585) 1998
Csirik (10.1016/j.cosrev.2016.12.001_br001040) 1990; 1
Garey (10.1016/j.cosrev.2016.12.001_br000820) 1976; 21
10.1016/j.cosrev.2016.12.001_br000435
10.1016/j.cosrev.2016.12.001_br000310
10.1016/j.cosrev.2016.12.001_br000670
10.1016/j.cosrev.2016.12.001_br000790
Vazirani (10.1016/j.cosrev.2016.12.001_br000145) 2001
Bartal (10.1016/j.cosrev.2016.12.001_br000950) 1992
Boyar (10.1016/j.cosrev.2016.12.001_br000175) 2007; 3
Tang (10.1016/j.cosrev.2016.12.001_br000335) 2013
Boyar (10.1016/j.cosrev.2016.12.001_br000170) 2001; 31
Baker (10.1016/j.cosr
References_xml – reference: David R. Karger, Krzysztof Onak, Polynomial approximation schemes for smoothed and random instances of multidimensional packing problems, in: SODA, 2007, pp. 1207–1216.
– reference: Michel X. Goemans, Thomas Rothvoß, Polynomiality for bin packing with a constant number of item types. in: SODA 2014, 2014, pp. 830–839.
– volume: 29
  start-page: 459
  year: 1999
  end-page: 473
  ident: br000965
  article-title: Better bounds for online scheduling
  publication-title: SIAM J. Comput.
– reference: Nikhil Bansal, Andrea Lodi, Maxim Sviridenko, A tale of two dimensional bin packing, in: FOCS,2005, pp. 657–666.
– start-page: 455
  year: 2013
  end-page: 531
  ident: br000100
  article-title: Bin packing approximation algorithms: Survey and classification
  publication-title: Handbook of Combinatorial Optimization
– volume: 21
  start-page: 257
  year: 1976
  end-page: 298
  ident: br000820
  article-title: Resource constrained scheduling as generalized bin packing
  publication-title: J. Combin. Theory Ser. A
– reference: Fidaa Abed, Parinya Chalermsook, José R. Correa, Andreas Karrenbauer, Pablo Pérez-Lantero, José A. Soto, Andreas Wiese, On guillotine cutting sequences, in: APPROX, 2015, pp. 1–19.
– volume: 14
  start-page: 13
  year: 1999
  end-page: 25
  ident: br001015
  article-title: Two simple algorithms for bin covering
  publication-title: Acta Cybernet.
– volume: 31
  start-page: 35
  year: 2003
  end-page: 41
  ident: br000810
  article-title: An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
  publication-title: Oper. Res. Lett.
– volume: 34
  start-page: 144
  year: 1987
  end-page: 162
  ident: br000890
  article-title: Using dual approximation algorithms for scheduling problems theoretical and practical results
  publication-title: J. ACM (JACM)
– volume: 15
  start-page: 100
  year: 1984
  end-page: 109
  ident: br000395
  article-title: Approximation algorithms for the m-dimensional 0–1 knapsack problem: Worst-case and probabilistic analyses
  publication-title: European J. Oper. Res.
– start-page: 398
  year: 2003
  end-page: 407
  ident: br000545
  article-title: Two dimensional packing: the power of rotation
  publication-title: Mathematical Foundations of Computer Science 2003
– volume: 9
  start-page: 24
  year: 2013
  ident: br000245
  article-title: Bin packing via discrepancy of permutations
  publication-title: ACM Trans. Algorithms
– volume: 412
  start-page: 583
  year: 2011
  end-page: 593
  ident: br000675
  article-title: Improved online algorithms for parallel job scheduling and strip packing
  publication-title: Theoret. Comput. Sci.
– year: 1983
  ident: br001000
  article-title: Problems in discrete applied mathematics
– volume: 35
  start-page: 431
  year: 2005
  end-page: 448
  ident: br000460
  article-title: Optimal online algorithms for multidimensional packing problems
  publication-title: SIAM J. Comput.
– volume: 1
  start-page: 87
  year: 1990
  end-page: 95
  ident: br001040
  article-title: A dual version of bin packing
  publication-title: Algorithms Rev.
– volume: 7
  start-page: 110
  year: 2001
  end-page: 113
  ident: br000560
  article-title: Multidimensional cube packing
  publication-title: Electron. Notes Discrete Math.
– volume: 47
  start-page: 323
  year: 2007
  end-page: 342
  ident: br000725
  article-title: Maximizing the total profit of rectangles packed into a rectangle
  publication-title: Algorithmica
– volume: 34
  start-page: 564
  year: 2006
  end-page: 568
  ident: br000905
  article-title: Carathéodory bounds for integer cones
  publication-title: Oper. Res. Lett.
– volume: 12
  start-page: 189
  year: 1991
  end-page: 203
  ident: br001030
  article-title: Probabilistic analysis of algorithms for dual bin packing problems
  publication-title: J. Algorithms
– volume: 141
  start-page: 241
  year: 2002
  end-page: 252
  ident: br000135
  article-title: Two-dimensional packing problems: A survey
  publication-title: European J. Oper. Res.
– volume: 10
  start-page: 305
  year: 1989
  end-page: 326
  ident: br000285
  article-title: On-line bin packing in linear time
  publication-title: J. Algorithms
– start-page: 151
  year: 1999
  end-page: 207
  ident: br000090
  article-title: Bin packing approximation algorithms: Combinatorial analysis
  publication-title: Handbook of Combinatorial Optimization
– volume: 27
  start-page: 207
  year: 1980
  end-page: 227
  ident: br000805
  article-title: New algorithms for bin packing
  publication-title: J. ACM (JACM)
– volume: 45
  start-page: 1563
  year: 1966
  end-page: 1581
  ident: br000945
  article-title: Bounds for certain multiprocessing anomalies
  publication-title: Bell Syst. Tech. J.
– reference: Varun Gupta, Ana Radovanovic, Online stochastic bin packing, 2012. arXiv preprint
– volume: 18
  start-page: 221
  year: 2010
  end-page: 239
  ident: br000570
  article-title: A note on online hypercube packing
  publication-title: CEJOR Cent. Eur. J. Oper. Res.
– reference: Alberto Caprara, Packing 2-dimensional bins in harmony, in: FOCS, 2002, pp. 490–499.
– reference: Walter Kern, Jacob Jan Paulus, A tight analysis of brown-baker-katseff sequences for online strip packing, in: CTW, 2010, pp. 109–110.
– reference: Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Two for one: Tight approximation of 2D bin packing, in; WADS, 2009, pp. 399–410.
– reference: Rolf Harren, Rob van Stee, Improved absolute approximation ratios for two-dimensional packing problems, in: APPROX-RANDOM, 2009, pp. 177–189.
– reference: David de Laat, Frank Vallentin, A breakthrough in sphere packing: The search for magic functions. arXiv preprint
– volume: 97
  start-page: 3
  year: 2003
  end-page: 26
  ident: br000160
  article-title: Online algorithms: a survey
  publication-title: Math. Program.
– volume: 93
  start-page: 241
  year: 1991
  end-page: 262
  ident: br000155
  article-title: Completeness in approximation classes
  publication-title: Inform. Comput.
– reference: Klaus Jansen, Rob van Stee, On strip packing with rotations, in: STOC, 2005, pp. 755–761.
– volume: 28
  start-page: 217
  year: 1992
  end-page: 225
  ident: br000105
  article-title: The pallet loading problem: A survey
  publication-title: Int. J. Prod. Econ.
– volume: 1
  start-page: 55
  year: 1998
  end-page: 66
  ident: br000895
  article-title: Approximation schemes for scheduling on parallel machines
  publication-title: J. Sched.
– reference: Arindam Khan, Mohit Singh, On weighted bipartite edge coloring, in: FSTTCS, 2015, pp. 136–150.
– volume: 30
  start-page: 65
  year: 1999
  end-page: 74
  ident: br000065
  article-title: Who is interested in algorithms and why?: lessons from the stony brook algorithms repository
  publication-title: ACM SIGACT News
– year: 1979
  ident: br000040
  article-title: Computers and Interactibility: A Guide to the Theory of NP-Completeness
– volume: 306
  start-page: 543
  year: 2003
  end-page: 551
  ident: br000350
  article-title: An asymptotic fully polynomial time approximation scheme for bin covering
  publication-title: Theoret. Comput. Sci.
– reference: David G. Harris, Aravind Srinivasan, The moser-tardos framework with partial resampling, in: FOCS, 2013, pp. 469–478.
– year: 1973
  ident: br000030
  article-title: Near-optimal bin packing algorithms
– volume: 50
  start-page: 113
  year: 1994
  end-page: 116
  ident: br000955
  article-title: A better lower bound for on-line scheduling
  publication-title: Inform. Process. Lett.
– volume: 7
  start-page: 50
  year: 2011
  ident: br000515
  article-title: A new upper bound 2.5545 on 2D online bin packing
  publication-title: ACM Trans. Algorithms
– reference: Anna Adamaszek, Tomasz Kociumaka, Marcin Pilipczuk, Michal Pilipczuk, Hardness of approximation for strip packing. CoRR, abs/1610.07766, 2016.
– volume: 3
  start-page: 22
  year: 2007
  ident: br000175
  article-title: The relative worst order ratio for online algorithms
  publication-title: ACM Trans. Algorithms (TALG)
– reference: György Dósa, Jirí Sgall, Optimal analysis of best fit bin packing, in: ICALP, 2014, pp. 429–441.
– year: 1995
  ident: br000525
  article-title: Lower and upper bounds for online bin packing and scheduling heuristics
– volume: 16
  start-page: 206
  year: 1984
  end-page: 215
  ident: br000115
  article-title: Prototype models for two-dimensional layout design of robot systems
  publication-title: IIE Trans.
– reference: Nikhil Bansal, Marek Eliás, Arindam Khan, Improved approximation for vector bin packing, in: SODA, 2016, pp. 1561–1579.
– reference: Anna Adamaszek, Andreas Wiese, Approximation schemes for maximum weight independent set of rectangles, in: FOCS, 2013, pp. 400–409.
– reference: Nikhil Bansal, Arindam Khan, Improved approximation algorithm for two-dimensional bin packing, in: SODA, 2014, pp. 13–25.
– start-page: 2323
  year: 2016
  end-page: 2326
  ident: br000940
  article-title: Vector scheduling problems
  publication-title: Encyclopedia of Algorithms
– volume: 42
  start-page: 501
  year: 2006
  end-page: 514
  ident: br000925
  article-title: Vector assignment schemes for asymmetric settings
  publication-title: Acta Inform.
– volume: 21
  start-page: 104
  year: 1998
  end-page: 118
  ident: br001045
  article-title: On-line and off-line approximation algorithms for vector covering problems
  publication-title: Algorithmica
– volume: 11
  start-page: 23
  year: 1993
  end-page: 34
  ident: br000825
  article-title: A lower bound for on-line vector-packing algorithms
  publication-title: Acta Cybern.
– reference: Chandra Chekuri, Jan Vondrák, Rico Zenklusen, Multi-budgeted matchings and matroid intersection via dependent rounding, in: SODA, 2011, pp. 1080–1097.
– start-page: 202
  year: 2000
  end-page: 210
  ident: br000975
  article-title: Online scheduling revisited
  publication-title: European Symposium on Algorithms
– start-page: 228
  year: 2006
  end-page: 243
  ident: br000550
  article-title: This side up!
  publication-title: ACM Transactions on Algorithms (TALG), Vol. 2
– volume: 44
  start-page: 486
  year: 1997
  end-page: 504
  ident: br000985
  article-title: On-line routing of virtual circuits with applications to load balancing and machine scheduling
  publication-title: J. ACM (JACM)
– volume: 6
  start-page: 310
  year: 2009
  end-page: 323
  ident: br000640
  article-title: Rectangle packing with one-dimensional resource augmentation
  publication-title: Discrete Optim.
– reference: Nikhil Bansal, Xin Han, Kazuo Iwama, Sviridenko Maxim, Guochuan Zhang, Harmonic algorithm for 3-dimensional strip packing problem, in: SODA, 2007, pp. 1197–1206.
– reference: Waldo Gálvez, Fabrizio Grandoni, Salvatore Ingala, Arindam Khan, Improved pseudo-polynomial-time approximation for strip packing, in: FSTTCS, 2016, pp. 9:1–9:14.
– volume: 64
  start-page: 293
  year: 1997
  end-page: 297
  ident: br000795
  article-title: There is no asymptotic ptas for two-dimensional vector packing
  publication-title: Inform. Process. Lett.
– reference: Yossi Azar, Ilan Reuven Cohen, Alan Roytman, Online lower bounds via duality, in: SODA, 2017. (in press).
– reference: Yossi Azar, Ilan Reuven Cohen, Amos Fiat, Alan Roytman, Packing small vectors, in: SODA, 2016, pp. 1511–1525.
– volume: 22
  start-page: 463
  year: 1975
  end-page: 468
  ident: br000855
  article-title: Fast approximation algorithms for the knapsack and sum of subset problems
  publication-title: J. ACM (JACM)
– reference: Nikhil Bansal, Alberto Caprara, Klaus Jansen, Lars Prädel, Maxim Sviridenko, A structural lemma in 2-dimensional packing, and its implications on approximability, in: ISAAC, 2009, pp. 77–86.
– reference: Sandy Heydrich, Rob van Stee, Improved lower bounds for online hypercube packing. CoRR, abs/1607.01229, 2016.
– year: 1996
  ident: br000045
  article-title: Approximation Algorithms for NP-Hard Problems
– volume: 209
  start-page: 107
  year: 1998
  end-page: 122
  ident: br000180
  article-title: Differential approximation algorithms for some combinatorial optimization problems
  publication-title: Theoret. Comput. Sci.
– volume: 11
  start-page: 1081
  year: 2001
  end-page: 1091
  ident: br000385
  article-title: Approximate max–min resource sharing for structured concave optimization
  publication-title: SIAM J. Optim.
– volume: 110
  start-page: 707
  year: 2010
  end-page: 710
  ident: br000400
  article-title: There is no eptas for two-dimensional knapsack
  publication-title: Inform. Process. Lett.
– volume: 10
  start-page: 271
  year: 1990
  end-page: 275
  ident: br000555
  article-title: Packing squares into a square
  publication-title: J. Parallel Distrib. Comput.
– year: 2015
  ident: br000880
  article-title: Scheduling
– volume: 123
  start-page: 333
  year: 2000
  end-page: 345
  ident: br000870
  article-title: Approximation algorithms for knapsack problems with cardinality constraints
  publication-title: European J. Oper. Res.
– volume: 15
  start-page: 63
  year: 2012
  end-page: 75
  ident: br000480
  article-title: Absolute approximation ratios for packing rectangles into bins
  publication-title: J. Sched.
– volume: 32
  start-page: 562
  year: 1985
  end-page: 572
  ident: br000280
  article-title: A simple on-line bin-packing algorithm
  publication-title: J. ACM
– reference: , 2016.
– volume: 9
  start-page: 846
  year: 1980
  end-page: 855
  ident: br000125
  article-title: Orthogonal packings in two dimensions
  publication-title: SIAM J. Comput.
– reference: György Dósa, Jiri Sgall, First fit bin packing: A tight analysis, in: STACS 2013, 2013, pp. 538–549.
– volume: 12
  start-page: 508
  year: 1983
  end-page: 525
  ident: br000645
  article-title: Shelf algorithms for two-dimensional packing problems
  publication-title: SIAM J. Comput.
– start-page: 51
  year: 1992
  end-page: 58
  ident: br000950
  article-title: New algorithms for an ancient scheduling problem
  publication-title: STOC
– volume: 30
  start-page: 150
  year: 2005
  end-page: 172
  ident: br000370
  article-title: Fast approximation schemes for two-stage, two-dimensional bin packing
  publication-title: Math. Oper. Res.
– start-page: 327
  year: 2014
  end-page: 338
  ident: br000700
  article-title: A new asymptotic approximation algorithm for 3-dimensional strip packing
  publication-title: SOFSEM 2014: Theory and Practice of Computer Science
– volume: 47
  start-page: 248
  year: 2014
  end-page: 267
  ident: br000605
  article-title: A
  publication-title: Comput. Geom.
– volume: 19
  start-page: 847
  year: 1990
  end-page: 867
  ident: br000685
  article-title: On three-dimensional packing
  publication-title: SIAM J. Comput.
– start-page: 1133
  year: 2013
  end-page: 1141
  ident: br000335
  article-title: Smoothing the energy consumption: Peak demand reduction in smart grid
  publication-title: INFOCOM
– year: 2015
  ident: br000355
  article-title: Approximation algorithms for multidimensional bin packing
– reference: Sandy Heydrich, Andreas Wiese, Faster approximation schemes for the two-dimensional knapsack problem, in: SODA, 2017, (in press).
– start-page: 49
  year: 1984
  end-page: 106
  ident: br000075
  article-title: Approximation algorithms for bin-packin: an updated survey
  publication-title: Algorithm Design for Computer System Design
– volume: 53
  start-page: 1
  year: 2006
  end-page: 65
  ident: br000325
  article-title: On the sum-of-squares algorithm for bin packing
  publication-title: J. ACM (JACM)
– volume: 21
  start-page: 19
  year: 1994
  end-page: 25
  ident: br000120
  article-title: A branch-and-bound algorithm for the two-dimensional vector packing problem
  publication-title: Comput. Oper. Res.
– volume: 76
  start-page: 1077
  year: 2016
  end-page: 1096
  ident: br000930
  article-title: Approximating vector scheduling: Almost matching upper and lower bounds
  publication-title: Algorithmica
– reference: Anshu Ranjan, Pramod Khargonekar, Sartaj Sahni, Offline first fit scheduling in smart grids, in: IEEE SCC, 2015, pp. 758–763.
– reference: Thomas Rothvoß, The entropy rounding method in approximation algorithms, in: SODA, 2012, pp. 356–372.
– volume: 45
  start-page: 76
  year: 2014
  end-page: 82
  ident: br000785
  article-title: Computational geometry column 60
  publication-title: SIGACT News
– volume: 4
  start-page: 185
  year: 2007
  end-page: 197
  ident: br000575
  article-title: Bounds for online bounded space hypercube packing
  publication-title: Discrete Optim.
– volume: 10
  start-page: 37
  year: 1980
  end-page: 40
  ident: br000595
  article-title: A 2.5 times optimal algorithm for packing in two dimensions
  publication-title: Inform. Process. Lett.
– year: 2004
  ident: br000865
  article-title: Introduction to NP-Completeness of Knapsack Problems
– reference: A. Sebö, G. Shmonin, Proof of the modified integer round-up conjecture for bin packing in dimension 7. Manuscript, 2009.
– reference: .
– reference: Narendra Karmarkar, Richard M. Karp, An efficient approximation scheme for the one-dimensional bin-packing problem, in: FOCS, 1982, pp. 312–320.
– reference: János Balogh, József Békési, György Dósa, Jirí Sgall, Rob van Stee, The optimal absolute ratio for online bin packing, in: SODA, 2015, pp. 1425–1438.
– reference: Sandy Heydrich, Rob van Stee, Beating the harmonic lower bound for online bin packing, in: ICALP, 2016, pp. 41:1–41:14.
– reference: Shachar Lovett, Raghu Meka, Constructive discrepancy minimization by walking on the edges, in: FOCS, 2012, pp. 61–67.
– volume: 21
  start-page: 321
  year: 1996
  end-page: 340
  ident: br001025
  article-title: Coordination complexity of parallel price-directive decomposition
  publication-title: Math. Oper. Res.
– volume: 10
  start-page: 571
  year: 1981
  end-page: 582
  ident: br000630
  article-title: Performance bounds for orthogonal oriented two-dimensional packing algorithms
  publication-title: SIAM J. Comput.
– volume: 3
  start-page: 66
  year: 1982
  end-page: 76
  ident: br000445
  article-title: On packing two-dimensional bins
  publication-title: SIAM J. Algebr. Discrete Methods
– reference: M.R. Garey, Ronald L. Graham, Jeffrey D. Ullman, Worst-case analysis of memory allocation algorithms, in: STOC, 1972, pp. 143–150.
– year: 1988
  ident: br000220
  article-title: Geometric algorithm and combinatorial optimization
  publication-title: Algorithms and Combinatorics: Study and Research Texts, Vol. 2
– reference: Brian Brubach, Improved bound for online square-into-square packing, in: WAOA, 2014, pp. 47–58.
– reference: David S. Johnson, Approximation algorithms for combinatorial problems, in: STOC, 1973, pp. 38–49.
– volume: 13
  start-page: 589
  year: 1992
  end-page: 605
  ident: br000690
  article-title: Heuristic algorithms for on-line packing in three dimensions
  publication-title: J. Algorithms
– volume: 33
  start-page: 121
  year: 2005
  end-page: 126
  ident: br000475
  article-title: A 3-approximation algorithm for two-dimensional bin packing
  publication-title: Oper. Res. Lett.
– reference: Klaus Jansen, Guochuan Zhang, Maximizing the number of packed rectangles, in: SWAT, 2004, pp. 362–371.
– reference: Klaus Jansen, Lars Prädel, New approximability results for two-dimensional bin packing, in: SODA, 2013.
– reference: Miroslav Chlebík, Janka Chlebíková, Inapproximability results for orthogonal rectangle packing problems with rotations, in: CIAC, 2006, pp. 199–210.
– year: 1971
  ident: br000020
  article-title: The performance of a memory allocation algorithm. Technical Report 100
– volume: 49
  start-page: 640
  year: 2002
  end-page: 671
  ident: br000290
  article-title: On the online bin packing problem
  publication-title: J. ACM (JACM)
– volume: 16
  start-page: 47
  year: 2003
  end-page: 56
  ident: br000830
  article-title: On variable sized vector packing
  publication-title: Acta Cybern.
– reference: Thomas Rothvoß, Approximating bin packing within o(log opt * log log opt) bins, in: FOCS, 2013, pp. 20–29.
– volume: 35
  start-page: 39
  year: 2015
  end-page: 61
  ident: br000780
  article-title: Packing anchored rectangles
  publication-title: Combinatorica
– reference: Rebecca Hoberg, Thomas Rothvoß, A logarithmic additive integrality gap for bin packing, in: SODA, 2017.
– volume: 26
  start-page: 401
  year: 1997
  end-page: 409
  ident: br000380
  article-title: A strip-packing algorithm with absolute performance bound 2
  publication-title: SIAM J. Comput.
– year: 2007
  ident: br000055
  article-title: Handbook of Approximation Algorithms and Metaheuristics
– reference: Klaus Jansen, Roberto Solis-Oba, A polynomial time approximation scheme for the square packing problem, in: IPCO, 2008, pp. 184–198.
– reference: Yossi Azar, Ilan Reuven Cohen, Seny Kamara, Bruce Shepherd, Tight bounds for online vector bin packing, in: STOC, 2013, pp. 961–970.
– volume: 17
  start-page: 417
  year: 2009
  end-page: 423
  ident: br000680
  article-title: A note on online strip packing
  publication-title: J. Comb. Optim.
– volume: 17
  start-page: 539
  year: 1988
  end-page: 551
  ident: br000910
  article-title: A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach
  publication-title: SIAM J. Comput.
– year: 2001
  ident: br000145
  article-title: Approximation Algorithms
– volume: 102
  start-page: 519
  year: 2005
  end-page: 530
  ident: br000705
  article-title: The two-dimensional cutting stock problem revisited
  publication-title: Math. Program.
– volume: 1
  start-page: 349
  year: 1981
  end-page: 355
  ident: br000185
  article-title: Bin packing can be solved within 1+epsilon in linear time
  publication-title: Combinatorica
– volume: 2
  start-page: 348
  year: 1981
  end-page: 368
  ident: br000635
  article-title: A 5/4 algorithm for two-dimensional packing
  publication-title: J. Algorithms
– volume: 43
  start-page: 127
  year: 2012
  end-page: 136
  ident: br000315
  article-title: SIGACT news online algorithms column 20: the power of harmony
  publication-title: SIGACT News
– volume: 9
  start-page: 107
  year: 1989
  end-page: 119
  ident: br000885
  article-title: On the performance of on-line algorithms for partition problems
  publication-title: Acta Cybernet.
– year: 2016
  ident: br000655
  article-title: Approximate strip packing: Revisited
  publication-title: Inform. Comput.
– volume: 5
  start-page: 502
  year: 1984
  end-page: 525
  ident: br001005
  article-title: On a dual version of the one-dimensional bin packing problem
  publication-title: J. Algorithms
– volume: 55
  start-page: 59
  year: 1994
  end-page: 82
  ident: br001050
  article-title: on some geometric methods in scheduling theory: A survey
  publication-title: Discrete Appl. Math.
– volume: 46
  start-page: 105
  year: 2015
  end-page: 112
  ident: br000530
  article-title: SIGACT news online algorithms column 26: Bin packing in multiple dimensions
  publication-title: ACM SIGACT News
– start-page: 359
  year: 2004
  end-page: 368
  ident: br000455
  article-title: Packing problems with orthogonal rotations
  publication-title: LATIN
– volume: 18
  start-page: 207
  year: 1982
  end-page: 225
  ident: br000660
  article-title: Lower bounds for on-line two-dimensional packing algorithms
  publication-title: Acta Inform.
– volume: 25
  start-page: 645
  year: 2000
  end-page: 656
  ident: br000450
  article-title: A near-optimal solution to a two-dimensional cutting stock problem
  publication-title: Math. Oper. Res.
– start-page: 290
  year: 1994
  end-page: 299
  ident: br000600
  article-title: Reverse-fit: A 2-optimal algorithm for packing rectangles
  publication-title: ESA
– reference: Klaus Jansen, Kim-Manuel Klein, About the structure of the integer cone and its application to bin packing, in: SODA, 2017, (in press).
– volume: 48
  start-page: 360
  year: 2003
  end-page: 384
  ident: br000920
  article-title: Vector assignment problems: a general framework
  publication-title: J. Algorithms
– reference: Vincenzo Bonifaci, Andreas Wiese, Scheduling unrelated machines of few different types. CoRR, abs/1205.0974, 2012.
– volume: 3
  start-page: 299
  year: 1974
  end-page: 325
  ident: br000035
  article-title: Worst-case performance bounds for simple one-dimensional packing algorithms
  publication-title: SIAM J. Comput.
– reference: Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, On efficient weighted rectangle packing with large resources, in: ISAAC, 2005, pp. 1039–1050.
– reference: Steven S. Seiden, Rob van Stee, New bounds for multi-dimensional packing, in: SODA, 2002, pp. 486–495.
– start-page: 147
  year: 1981
  end-page: 172
  ident: br000070
  article-title: Approximation algorithms for bin packing problems: A survey
  publication-title: Analysis and Design of Algorithms in Combinatorial Optimization
– volume: 23
  start-page: 749
  year: 2008
  end-page: 762
  ident: br000765
  article-title: Approximation algorithms for 3D orthogonal knapsack
  publication-title: J. Comput. Sci. Technol.
– reference: Magnús M. Halldórsson, Mario Szegedy, Lower bounds for on-line graph coloring, in: SODA, 1992, pp. 211–216.
– volume: 4
  start-page: 339
  year: 1979
  end-page: 356
  ident: br000860
  article-title: Fast approximation algorithms for knapsack problems
  publication-title: Math. Oper. Res.
– reference: Klaus Jansen, Parameterized approximation scheme for the multiple knapsack problem, in: SODA, 2009, pp. 665–674.
– volume: 79
  start-page: 39
  year: 2013
  end-page: 49
  ident: br000275
  article-title: Bin packing with fixed number of bins revisited
  publication-title: J. Comput. System Sci.
– reference: Janos Csirik, David S. Johnson, Claire Kenyon, Better approximation algorithms for bin covering, in: SODA, 2001.
– reference: Klaus Jansen, Roberto Solis-Oba, New approximability results for 2-dimensional packing problems, in: MFCS, 2007, pp. 103–114.
– reference: Peter W. Shor, How to pack better than best fit: tight bounds for average-case online bin packing, in: FOCS, 1991, pp. 752–759.
– volume: 24
  start-page: 457
  year: 2010
  end-page: 485
  ident: br000900
  article-title: An eptas for scheduling jobs on uniform processors: using an milp relaxation with a constant number of integral variables
  publication-title: SIAM J. Discrete Math.
– reference: Adam Meyerson, Alan Roytman, Brian Tagiku, Online multidimensional load balancing, in: APPROX, 2013, pp. 287–302.
– volume: 32
  start-page: 5
  year: 2004
  end-page: 14
  ident: br000720
  article-title: On the two-dimensional knapsack problem
  publication-title: Oper. Res. Lett.
– reference: Claire Kenyon, Best-fit bin-packing with random order, in: SODA, Vol. 96, 1996, pp. 359–364.
– volume: 8
  start-page: 17
  year: 1989
  end-page: 20
  ident: br000500
  article-title: Multidimensional on-line bin packing: algorithms and worst-case analysis
  publication-title: Oper. Res. Lett.
– volume: 20
  start-page: 93
  year: 1997
  end-page: 100
  ident: br000235
  article-title: Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
  publication-title: Oper. Res. Lett.
– volume: 17
  start-page: 259
  year: 1971
  end-page: 268
  ident: br000010
  article-title: The loading problem
  publication-title: Manage. Sci.
– reference: Sungjin Im, Nathaniel Kell, Janardhan Kulkarni, Debmalya Panigrahi, Tight bounds for online vector scheduling, in: FOCS, 2015, pp. 525–544.
– year: 2005
  ident: br000060
  article-title: Online Computation and Competitive Analysis
– year: 1998
  ident: br000585
  article-title: Packing of squares into squares
  publication-title: Pesquisa Operacional
– volume: 13
  start-page: 149
  year: 1993
  end-page: 158
  ident: br000505
  article-title: An on-line algorithm for multidimensional bin packing
  publication-title: Oper. Res. Lett.
– volume: 440–441
  start-page: 1
  year: 2012
  end-page: 13
  ident: br000300
  article-title: New lower bounds for certain classes of bin packing algorithms
  publication-title: Theoret. Comput. Sci.
– volume: 411
  start-page: 2899
  year: 2010
  end-page: 2911
  ident: br000540
  article-title: Two-dimensional online bin packing with rotation
  publication-title: Theoret. Comput. Sci.
– reference: Todd Gormley, Nicholas Reingold, Eric Torng, Jeffery Westbrook, Generating adversaries for request-answer games, in: SODA, 2000.
– volume: 43
  start-page: 277
  year: 1992
  end-page: 284
  ident: br000305
  article-title: An improved lower bound for on-line bin packing algorithms
  publication-title: Inform. Process. Lett.
– year: 1971
  ident: br000015
  article-title: Theory of Scheduling, 1967
– reference: Alantha Newman, Ofer Neiman, Aleksandar Nikolov, Beck’s three permutations conjecture: A counterexample and some consequences, in: FOCS, 2012, pp. 253–262.
– year: 2011
  ident: br000980
  article-title: Improved bounds for the on-line scheduling problem
– volume: 4
  start-page: 143
  year: 2007
  end-page: 153
  ident: br000590
  article-title: Two-dimensional bin packing with one-dimensional resource augmentation
  publication-title: Discrete Optim.
– volume: 20
  start-page: 257
  year: 1995
  end-page: 301
  ident: br000225
  article-title: Fast approximate algorithm for fractional packing and covering problems
  publication-title: Math. Oper. Res.
– volume: 39
  start-page: 1256
  year: 2009
  end-page: 1278
  ident: br000430
  article-title: A new approximation method for set covering problems, with applications to multidimensional bin packing
  publication-title: SIAM J. Comput.
– reference: Anna Adamaszek, Andreas Wiese, A quasi-ptas for the two-dimensional geometric knapsack problem, in: SODA, 2015, pp. 1491–1505.
– volume: 31
  start-page: 31
  year: 2006
  end-page: 49
  ident: br000375
  article-title: Bin packing in multiple dimensions: Inapproximability results and approximation schemes
  publication-title: Math. Oper. Res.
– volume: 41
  start-page: 595
  year: 2005
  end-page: 606
  ident: br000565
  article-title: Online square and cube packing
  publication-title: Acta Inform.
– volume: 31
  start-page: 233
  year: 2001
  end-page: 258
  ident: br000170
  article-title: The accommodating function: A generalization of the competitive ratio
  publication-title: SIAM J. Comput.
– volume: 2
  start-page: 147
  year: 1981
  end-page: 152
  ident: br000200
  article-title: A tight asymptotic bound for next-fit-decreasing bin-packing
  publication-title: SIAM J. Algebr. Discrete Methods
– volume: 5
  start-page: 126
  year: 1968
  end-page: 134
  ident: br000365
  article-title: On packing of squares and cubes
  publication-title: J. Combin. Theory
– year: 2015
  ident: br000425
  article-title: Harmonic algorithm for bin packing
  publication-title: Encyclopedia of Algorithms
– reference: Giorgi Nadiradze, Andreas Wiese, On approximating strip packing with a better ratio than 3/2, in: SODA, 2016, pp. 1491–1510.
– reference: Klaus Jansen, Malin Rau, Improved approximation for two dimensional strip packing with polynomial bounded width. CoRR, abs/1610.04430, 2016.
– reference: T. Gaizer, An algorithm for the 2D dual bin packing problem. Unpublished manuscript, University of Szeged, Hungary, 1989.
– reference: Rina Panigrahy, Kunal Talwar, Lincoln Uyeda, Udi Wieder, Heuristics for vector bin packing. research. microsoft. com, 2011.
– volume: 9
  start-page: 849
  year: 1961
  end-page: 859
  ident: br000005
  article-title: A linear programming approach to the cutting-stock problem
  publication-title: Oper. Res.
– volume: 9
  start-page: 808
  year: 1980
  end-page: 826
  ident: br000130
  article-title: Performance bounds for level-oriented two-dimensional packing algorithms
  publication-title: SIAM J. Comput.
– year: 1991
  ident: br000080
  article-title: Probabilistic Analysis of Packing and Partitioning Algorithms
– year: 2015
  ident: br000715
  article-title: Two-dimensional bin packing problem with guillotine restrictions
– volume: 33
  start-page: 837
  year: 2004
  end-page: 851
  ident: br000800
  article-title: On multidimensional packing problems
  publication-title: SIAM J. Comput.
– volume: 289
  start-page: 939
  year: 2002
  end-page: 952
  ident: br000535
  article-title: Two-dimensional on-line bin packing problem with rotatable items
  publication-title: Theoret. Comput. Sci.
– reference: David R. Karger, Steven J. Phillips, Eric Torng, A better algorithm for an ancient scheduling problem, in: SODA, Vol. 94, 1994, pp. 132–140.
– year: 1998
  ident: br000095
  article-title: On-Line Packing and Covering Problems
– reference: M. Karbasioun, G. Shaikhet, E. Kranakis, I. Lambadaris, Power strip packing of malleable demands in smart grid, in: IEEE International Conference on Communications, 2013, pp. 4261–4265.
– volume: 21
  start-page: 163
  year: 1988
  end-page: 167
  ident: br001010
  article-title: Online algorithms for a dual version of bin packing
  publication-title: Discrete Appl. Math.
– reference: D. Blitz, A. van Vliet, G.J. Woeginger, Lower bounds on the asymptotic worst-case ratio of online bin packing alorithms. Manuscript, 1996.
– year: 2011
  ident: br000150
  article-title: The Design of Approximation Algorithms
– volume: 47
  start-page: 112
  year: 2014
  end-page: 124
  ident: br000775
  article-title: Exact algorithms and apx-hardness results for geometric packing and covering problems
  publication-title: Comput. Geom.
– volume: 510
  start-page: 13
  year: 2013
  end-page: 61
  ident: br000210
  article-title: Tight absolute bound for first fit decreasing bin-packing: Ffd(l)
  publication-title: Theoret. Comput. Sci.
– volume: 8
  start-page: 121
  year: 2012
  end-page: 164
  ident: br000230
  article-title: The multiplicative weights update method: a meta-algorithm and applications
  publication-title: Theory Comput.
– volume: 63
  start-page: 171
  year: 1997
  end-page: 175
  ident: br000650
  article-title: Shelf algorithms for on-line strip packing
  publication-title: Inform. Process. Lett.
– reference: Rolf Harren, Rob van Stee, Packing rectangles into 2opt bins using rotations, in: SWAT, 2008, pp. 306–318.
– reference: Rolf Harren, Walter Kern, Improved lower bound for online strip packing - (extended abstract), in: WAOA, 2011, pp. 211–218.
– volume: 42
  start-page: 25
  year: 1995
  end-page: 45
  ident: br000085
  article-title: On-line bin packing - A restricted survey
  publication-title: Math. Methods OR
– volume: 8
  start-page: 121
  issue: 1
  year: 2012
  ident: 10.1016/j.cosrev.2016.12.001_br000230
  article-title: The multiplicative weights update method: a meta-algorithm and applications
  publication-title: Theory Comput.
  doi: 10.4086/toc.2012.v008a006
– start-page: 49
  year: 1984
  ident: 10.1016/j.cosrev.2016.12.001_br000075
  article-title: Approximation algorithms for bin-packin: an updated survey
– ident: 10.1016/j.cosrev.2016.12.001_br000580
– volume: 17
  start-page: 259
  issue: 5
  year: 1971
  ident: 10.1016/j.cosrev.2016.12.001_br000010
  article-title: The loading problem
  publication-title: Manage. Sci.
  doi: 10.1287/mnsc.17.5.259
– volume: 7
  start-page: 50
  issue: 4
  year: 2011
  ident: 10.1016/j.cosrev.2016.12.001_br000515
  article-title: A new upper bound 2.5545 on 2D online bin packing
  publication-title: ACM Trans. Algorithms
  doi: 10.1145/2000807.2000818
– volume: 33
  start-page: 837
  issue: 4
  year: 2004
  ident: 10.1016/j.cosrev.2016.12.001_br000800
  article-title: On multidimensional packing problems
  publication-title: SIAM J. Comput.
  doi: 10.1137/S0097539799356265
– year: 1995
  ident: 10.1016/j.cosrev.2016.12.001_br000525
– volume: 42
  start-page: 501
  issue: 6–7
  year: 2006
  ident: 10.1016/j.cosrev.2016.12.001_br000925
  article-title: Vector assignment schemes for asymmetric settings
  publication-title: Acta Inform.
  doi: 10.1007/s00236-005-0003-7
– volume: 19
  start-page: 847
  issue: 5
  year: 1990
  ident: 10.1016/j.cosrev.2016.12.001_br000685
  article-title: On three-dimensional packing
  publication-title: SIAM J. Comput.
  doi: 10.1137/0219059
– ident: 10.1016/j.cosrev.2016.12.001_br000190
  doi: 10.1109/FOCS.2013.11
– start-page: 151
  year: 1999
  ident: 10.1016/j.cosrev.2016.12.001_br000090
  article-title: Bin packing approximation algorithms: Combinatorial analysis
– volume: 14
  start-page: 13
  issue: 1
  year: 1999
  ident: 10.1016/j.cosrev.2016.12.001_br001015
  article-title: Two simple algorithms for bin covering
  publication-title: Acta Cybernet.
– volume: 11
  start-page: 23
  issue: 1–2
  year: 1993
  ident: 10.1016/j.cosrev.2016.12.001_br000825
  article-title: A lower bound for on-line vector-packing algorithms
  publication-title: Acta Cybern.
– ident: 10.1016/j.cosrev.2016.12.001_br000625
– year: 1971
  ident: 10.1016/j.cosrev.2016.12.001_br000020
– ident: 10.1016/j.cosrev.2016.12.001_br000215
  doi: 10.1007/978-3-662-43948-7_36
– year: 1983
  ident: 10.1016/j.cosrev.2016.12.001_br001000
– start-page: 327
  year: 2014
  ident: 10.1016/j.cosrev.2016.12.001_br000700
  article-title: A new asymptotic approximation algorithm for 3-dimensional strip packing
– ident: 10.1016/j.cosrev.2016.12.001_br000410
  doi: 10.1109/SFCS.2002.1181973
– volume: 47
  start-page: 323
  issue: 3
  year: 2007
  ident: 10.1016/j.cosrev.2016.12.001_br000725
  article-title: Maximizing the total profit of rectangles packed into a rectangle
  publication-title: Algorithmica
  doi: 10.1007/s00453-006-0194-5
– volume: 29
  start-page: 459
  issue: 2
  year: 1999
  ident: 10.1016/j.cosrev.2016.12.001_br000965
  article-title: Better bounds for online scheduling
  publication-title: SIAM J. Comput.
  doi: 10.1137/S0097539797324874
– volume: 32
  start-page: 562
  issue: 3
  year: 1985
  ident: 10.1016/j.cosrev.2016.12.001_br000280
  article-title: A simple on-line bin-packing algorithm
  publication-title: J. ACM
  doi: 10.1145/3828.3833
– volume: 110
  start-page: 707
  issue: 16
  year: 2010
  ident: 10.1016/j.cosrev.2016.12.001_br000400
  article-title: There is no eptas for two-dimensional knapsack
  publication-title: Inform. Process. Lett.
  doi: 10.1016/j.ipl.2010.05.031
– ident: 10.1016/j.cosrev.2016.12.001_br000610
  doi: 10.1137/1.9781611974331.ch102
– volume: 42
  start-page: 25
  issue: 1
  year: 1995
  ident: 10.1016/j.cosrev.2016.12.001_br000085
  article-title: On-line bin packing - A restricted survey
  publication-title: Math. Methods OR
  doi: 10.1007/BF01415672
– volume: 34
  start-page: 144
  issue: 1
  year: 1987
  ident: 10.1016/j.cosrev.2016.12.001_br000890
  article-title: Using dual approximation algorithms for scheduling problems theoretical and practical results
  publication-title: J. ACM (JACM)
  doi: 10.1145/7531.7535
– volume: 25
  start-page: 645
  issue: 4
  year: 2000
  ident: 10.1016/j.cosrev.2016.12.001_br000450
  article-title: A near-optimal solution to a two-dimensional cutting stock problem
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.25.4.645.12118
– volume: 24
  start-page: 457
  issue: 2
  year: 2010
  ident: 10.1016/j.cosrev.2016.12.001_br000900
  article-title: An eptas for scheduling jobs on uniform processors: using an milp relaxation with a constant number of integral variables
  publication-title: SIAM J. Discrete Math.
  doi: 10.1137/090749451
– volume: 411
  start-page: 2899
  issue: 31
  year: 2010
  ident: 10.1016/j.cosrev.2016.12.001_br000540
  article-title: Two-dimensional online bin packing with rotation
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/j.tcs.2010.04.021
– ident: 10.1016/j.cosrev.2016.12.001_br000740
  doi: 10.1007/978-3-540-68891-4_13
– ident: 10.1016/j.cosrev.2016.12.001_br000695
– ident: 10.1016/j.cosrev.2016.12.001_br000970
– ident: 10.1016/j.cosrev.2016.12.001_br000110
– volume: 48
  start-page: 360
  issue: 2
  year: 2003
  ident: 10.1016/j.cosrev.2016.12.001_br000920
  article-title: Vector assignment problems: a general framework
  publication-title: J. Algorithms
  doi: 10.1016/S0196-6774(03)00055-5
– volume: 30
  start-page: 150
  issue: 1
  year: 2005
  ident: 10.1016/j.cosrev.2016.12.001_br000370
  article-title: Fast approximation schemes for two-stage, two-dimensional bin packing
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.1040.0112
– ident: 10.1016/j.cosrev.2016.12.001_br000490
  doi: 10.1007/978-3-642-03685-9_14
– year: 2005
  ident: 10.1016/j.cosrev.2016.12.001_br000060
– volume: 440–441
  start-page: 1
  year: 2012
  ident: 10.1016/j.cosrev.2016.12.001_br000300
  article-title: New lower bounds for certain classes of bin packing algorithms
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/j.tcs.2012.04.017
– ident: 10.1016/j.cosrev.2016.12.001_br000510
– volume: 22
  start-page: 463
  issue: 4
  year: 1975
  ident: 10.1016/j.cosrev.2016.12.001_br000855
  article-title: Fast approximation algorithms for the knapsack and sum of subset problems
  publication-title: J. ACM (JACM)
  doi: 10.1145/321906.321909
– ident: 10.1016/j.cosrev.2016.12.001_br000665
– year: 2015
  ident: 10.1016/j.cosrev.2016.12.001_br000425
  article-title: Harmonic algorithm for bin packing
– volume: 15
  start-page: 63
  issue: 1
  year: 2012
  ident: 10.1016/j.cosrev.2016.12.001_br000480
  article-title: Absolute approximation ratios for packing rectangles into bins
  publication-title: J. Sched.
  doi: 10.1007/s10951-009-0110-3
– year: 2015
  ident: 10.1016/j.cosrev.2016.12.001_br000355
– start-page: 51
  year: 1992
  ident: 10.1016/j.cosrev.2016.12.001_br000950
  article-title: New algorithms for an ancient scheduling problem
– volume: 10
  start-page: 571
  issue: 3
  year: 1981
  ident: 10.1016/j.cosrev.2016.12.001_br000630
  article-title: Performance bounds for orthogonal oriented two-dimensional packing algorithms
  publication-title: SIAM J. Comput.
  doi: 10.1137/0210042
– volume: 17
  start-page: 539
  issue: 3
  year: 1988
  ident: 10.1016/j.cosrev.2016.12.001_br000910
  article-title: A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach
  publication-title: SIAM J. Comput.
  doi: 10.1137/0217033
– ident: 10.1016/j.cosrev.2016.12.001_br000025
  doi: 10.1145/800152.804907
– year: 1996
  ident: 10.1016/j.cosrev.2016.12.001_br000045
– ident: 10.1016/j.cosrev.2016.12.001_br000620
– volume: 31
  start-page: 31
  issue: 1
  year: 2006
  ident: 10.1016/j.cosrev.2016.12.001_br000375
  article-title: Bin packing in multiple dimensions: Inapproximability results and approximation schemes
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.1050.0168
– volume: 2
  start-page: 348
  issue: 4
  year: 1981
  ident: 10.1016/j.cosrev.2016.12.001_br000635
  article-title: A 5/4 algorithm for two-dimensional packing
  publication-title: J. Algorithms
  doi: 10.1016/0196-6774(81)90034-1
– volume: 16
  start-page: 206
  issue: 3
  year: 1984
  ident: 10.1016/j.cosrev.2016.12.001_br000115
  article-title: Prototype models for two-dimensional layout design of robot systems
  publication-title: IIE Trans.
  doi: 10.1080/07408178408974686
– year: 2004
  ident: 10.1016/j.cosrev.2016.12.001_br000865
– ident: 10.1016/j.cosrev.2016.12.001_br000990
  doi: 10.1007/978-3-642-40328-6_21
– volume: 3
  start-page: 299
  issue: 4
  year: 1974
  ident: 10.1016/j.cosrev.2016.12.001_br000035
  article-title: Worst-case performance bounds for simple one-dimensional packing algorithms
  publication-title: SIAM J. Comput.
  doi: 10.1137/0203025
– ident: 10.1016/j.cosrev.2016.12.001_br000730
  doi: 10.1007/978-3-540-27810-8_31
– ident: 10.1016/j.cosrev.2016.12.001_br000845
  doi: 10.1137/1.9781611974331.ch103
– volume: 63
  start-page: 171
  issue: 4
  year: 1997
  ident: 10.1016/j.cosrev.2016.12.001_br000650
  article-title: Shelf algorithms for on-line strip packing
  publication-title: Inform. Process. Lett.
  doi: 10.1016/S0020-0190(97)00120-8
– volume: 47
  start-page: 112
  issue: 2
  year: 2014
  ident: 10.1016/j.cosrev.2016.12.001_br000775
  article-title: Exact algorithms and apx-hardness results for geometric packing and covering problems
  publication-title: Comput. Geom.
  doi: 10.1016/j.comgeo.2012.04.001
– year: 2016
  ident: 10.1016/j.cosrev.2016.12.001_br000655
  article-title: Approximate strip packing: Revisited
  publication-title: Inform. Comput.
  doi: 10.1016/j.ic.2016.03.010
– ident: 10.1016/j.cosrev.2016.12.001_br000270
  doi: 10.1137/1.9781611974782.103
– volume: 8
  start-page: 17
  issue: 1
  year: 1989
  ident: 10.1016/j.cosrev.2016.12.001_br000500
  article-title: Multidimensional on-line bin packing: algorithms and worst-case analysis
  publication-title: Oper. Res. Lett.
  doi: 10.1016/0167-6377(89)90027-8
– volume: 17
  start-page: 417
  issue: 4
  year: 2009
  ident: 10.1016/j.cosrev.2016.12.001_br000680
  article-title: A note on online strip packing
  publication-title: J. Comb. Optim.
  doi: 10.1007/s10878-007-9125-x
– volume: 31
  start-page: 35
  issue: 1
  year: 2003
  ident: 10.1016/j.cosrev.2016.12.001_br000810
  article-title: An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
  publication-title: Oper. Res. Lett.
  doi: 10.1016/S0167-6377(02)00173-6
– ident: 10.1016/j.cosrev.2016.12.001_br000735
  doi: 10.1007/978-3-540-74456-6_11
– start-page: 147
  year: 1981
  ident: 10.1016/j.cosrev.2016.12.001_br000070
  article-title: Approximation algorithms for bin packing problems: A survey
– volume: 53
  start-page: 1
  issue: 1
  year: 2006
  ident: 10.1016/j.cosrev.2016.12.001_br000325
  article-title: On the sum-of-squares algorithm for bin packing
  publication-title: J. ACM (JACM)
  doi: 10.1145/1120582.1120583
– start-page: 398
  year: 2003
  ident: 10.1016/j.cosrev.2016.12.001_br000545
  article-title: Two dimensional packing: the power of rotation
– ident: 10.1016/j.cosrev.2016.12.001_br000435
  doi: 10.1137/1.9781611973402.2
– volume: 79
  start-page: 39
  issue: 1
  year: 2013
  ident: 10.1016/j.cosrev.2016.12.001_br000275
  article-title: Bin packing with fixed number of bins revisited
  publication-title: J. Comput. System Sci.
  doi: 10.1016/j.jcss.2012.04.004
– volume: 43
  start-page: 127
  issue: 2
  year: 2012
  ident: 10.1016/j.cosrev.2016.12.001_br000315
  article-title: SIGACT news online algorithms column 20: the power of harmony
  publication-title: SIGACT News
  doi: 10.1145/2261417.2261440
– start-page: 290
  year: 1994
  ident: 10.1016/j.cosrev.2016.12.001_br000600
  article-title: Reverse-fit: A 2-optimal algorithm for packing rectangles
– volume: 43
  start-page: 277
  issue: 5
  year: 1992
  ident: 10.1016/j.cosrev.2016.12.001_br000305
  article-title: An improved lower bound for on-line bin packing algorithms
  publication-title: Inform. Process. Lett.
  doi: 10.1016/0020-0190(92)90223-I
– ident: 10.1016/j.cosrev.2016.12.001_br000615
– year: 1988
  ident: 10.1016/j.cosrev.2016.12.001_br000220
  article-title: Geometric algorithm and combinatorial optimization
  doi: 10.1007/978-3-642-97881-4
– ident: 10.1016/j.cosrev.2016.12.001_br000710
– volume: 12
  start-page: 189
  issue: 2
  year: 1991
  ident: 10.1016/j.cosrev.2016.12.001_br001030
  article-title: Probabilistic analysis of algorithms for dual bin packing problems
  publication-title: J. Algorithms
  doi: 10.1016/0196-6774(91)90001-F
– ident: 10.1016/j.cosrev.2016.12.001_br000770
  doi: 10.1007/978-3-319-18263-6_5
– volume: 31
  start-page: 233
  issue: 1
  year: 2001
  ident: 10.1016/j.cosrev.2016.12.001_br000170
  article-title: The accommodating function: A generalization of the competitive ratio
  publication-title: SIAM J. Comput.
  doi: 10.1137/S0097539799361786
– year: 1973
  ident: 10.1016/j.cosrev.2016.12.001_br000030
– volume: 64
  start-page: 293
  issue: 6
  year: 1997
  ident: 10.1016/j.cosrev.2016.12.001_br000795
  article-title: There is no asymptotic ptas for two-dimensional vector packing
  publication-title: Inform. Process. Lett.
  doi: 10.1016/S0020-0190(97)00179-8
– volume: 20
  start-page: 257
  year: 1995
  ident: 10.1016/j.cosrev.2016.12.001_br000225
  article-title: Fast approximate algorithm for fractional packing and covering problems
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.20.2.257
– volume: 141
  start-page: 241
  issue: 2
  year: 2002
  ident: 10.1016/j.cosrev.2016.12.001_br000135
  article-title: Two-dimensional packing problems: A survey
  publication-title: European J. Oper. Res.
  doi: 10.1016/S0377-2217(02)00123-6
– ident: 10.1016/j.cosrev.2016.12.001_br000250
  doi: 10.1109/FOCS.2012.84
– volume: 13
  start-page: 589
  issue: 4
  year: 1992
  ident: 10.1016/j.cosrev.2016.12.001_br000690
  article-title: Heuristic algorithms for on-line packing in three dimensions
  publication-title: J. Algorithms
  doi: 10.1016/0196-6774(92)90058-K
– volume: 10
  start-page: 37
  issue: 1
  year: 1980
  ident: 10.1016/j.cosrev.2016.12.001_br000595
  article-title: A 2.5 times optimal algorithm for packing in two dimensions
  publication-title: Inform. Process. Lett.
  doi: 10.1016/0020-0190(80)90121-0
– ident: 10.1016/j.cosrev.2016.12.001_br000050
  doi: 10.1145/800125.804034
– ident: 10.1016/j.cosrev.2016.12.001_br000415
  doi: 10.1137/1.9781611973105.66
– year: 2007
  ident: 10.1016/j.cosrev.2016.12.001_br000055
– year: 2011
  ident: 10.1016/j.cosrev.2016.12.001_br000980
– start-page: 2323
  year: 2016
  ident: 10.1016/j.cosrev.2016.12.001_br000940
  article-title: Vector scheduling problems
– volume: 33
  start-page: 121
  issue: 2
  year: 2005
  ident: 10.1016/j.cosrev.2016.12.001_br000475
  article-title: A 3-approximation algorithm for two-dimensional bin packing
  publication-title: Oper. Res. Lett.
  doi: 10.1016/j.orl.2004.04.004
– volume: 1
  start-page: 55
  issue: 1
  year: 1998
  ident: 10.1016/j.cosrev.2016.12.001_br000895
  article-title: Approximation schemes for scheduling on parallel machines
  publication-title: J. Sched.
  doi: 10.1002/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J
– volume: 44
  start-page: 486
  issue: 3
  year: 1997
  ident: 10.1016/j.cosrev.2016.12.001_br000985
  article-title: On-line routing of virtual circuits with applications to load balancing and machine scheduling
  publication-title: J. ACM (JACM)
  doi: 10.1145/258128.258201
– year: 1979
  ident: 10.1016/j.cosrev.2016.12.001_br000040
– volume: 1
  start-page: 87
  year: 1990
  ident: 10.1016/j.cosrev.2016.12.001_br001040
  article-title: A dual version of bin packing
  publication-title: Algorithms Rev.
– year: 2011
  ident: 10.1016/j.cosrev.2016.12.001_br000150
– volume: 289
  start-page: 939
  issue: 2
  year: 2002
  ident: 10.1016/j.cosrev.2016.12.001_br000535
  article-title: Two-dimensional on-line bin packing problem with rotatable items
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/S0304-3975(01)00410-8
– volume: 9
  start-page: 107
  issue: 2
  year: 1989
  ident: 10.1016/j.cosrev.2016.12.001_br000885
  article-title: On the performance of on-line algorithms for partition problems
  publication-title: Acta Cybernet.
– volume: 7
  start-page: 110
  year: 2001
  ident: 10.1016/j.cosrev.2016.12.001_br000560
  article-title: Multidimensional cube packing
  publication-title: Electron. Notes Discrete Math.
  doi: 10.1016/S1571-0653(04)00237-9
– ident: 10.1016/j.cosrev.2016.12.001_br000165
– volume: 306
  start-page: 543
  issue: 1
  year: 2003
  ident: 10.1016/j.cosrev.2016.12.001_br000350
  article-title: An asymptotic fully polynomial time approximation scheme for bin covering
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/S0304-3975(03)00363-3
– start-page: 1133
  year: 2013
  ident: 10.1016/j.cosrev.2016.12.001_br000335
  article-title: Smoothing the energy consumption: Peak demand reduction in smart grid
– volume: 35
  start-page: 431
  issue: 2
  year: 2005
  ident: 10.1016/j.cosrev.2016.12.001_br000460
  article-title: Optimal online algorithms for multidimensional packing problems
  publication-title: SIAM J. Comput.
  doi: 10.1137/S0097539705446895
– ident: 10.1016/j.cosrev.2016.12.001_br000345
  doi: 10.1109/ISCC.2015.7405605
– volume: 102
  start-page: 519
  issue: 3
  year: 2005
  ident: 10.1016/j.cosrev.2016.12.001_br000705
  article-title: The two-dimensional cutting stock problem revisited
  publication-title: Math. Program.
  doi: 10.1007/s10107-004-0548-1
– ident: 10.1016/j.cosrev.2016.12.001_br000840
  doi: 10.1090/dimacs/007/15
– volume: 9
  start-page: 846
  issue: 4
  year: 1980
  ident: 10.1016/j.cosrev.2016.12.001_br000125
  article-title: Orthogonal packings in two dimensions
  publication-title: SIAM J. Comput.
  doi: 10.1137/0209064
– year: 1998
  ident: 10.1016/j.cosrev.2016.12.001_br000585
  article-title: Packing of squares into squares
– volume: 50
  start-page: 113
  issue: 3
  year: 1994
  ident: 10.1016/j.cosrev.2016.12.001_br000955
  article-title: A better lower bound for on-line scheduling
  publication-title: Inform. Process. Lett.
  doi: 10.1016/0020-0190(94)00026-3
– volume: 5
  start-page: 126
  issue: 2
  year: 1968
  ident: 10.1016/j.cosrev.2016.12.001_br000365
  article-title: On packing of squares and cubes
  publication-title: J. Combin. Theory
  doi: 10.1016/S0021-9800(68)80047-X
– ident: 10.1016/j.cosrev.2016.12.001_br000440
  doi: 10.1137/1.9781611974331.ch106
– ident: 10.1016/j.cosrev.2016.12.001_br000670
  doi: 10.1007/978-3-642-29116-6_18
– ident: 10.1016/j.cosrev.2016.12.001_br000750
  doi: 10.1007/11602613_103
– ident: 10.1016/j.cosrev.2016.12.001_br000330
– start-page: 359
  year: 2004
  ident: 10.1016/j.cosrev.2016.12.001_br000455
  article-title: Packing problems with orthogonal rotations
– volume: 3
  start-page: 66
  year: 1982
  ident: 10.1016/j.cosrev.2016.12.001_br000445
  article-title: On packing two-dimensional bins
  publication-title: SIAM J. Algebr. Discrete Methods
  doi: 10.1137/0603007
– ident: 10.1016/j.cosrev.2016.12.001_br000265
  doi: 10.1137/1.9781611973402.61
– volume: 26
  start-page: 401
  issue: 2
  year: 1997
  ident: 10.1016/j.cosrev.2016.12.001_br000380
  article-title: A strip-packing algorithm with absolute performance bound 2
  publication-title: SIAM J. Comput.
  doi: 10.1137/S0097539793255801
– volume: 55
  start-page: 59
  issue: 1
  year: 1994
  ident: 10.1016/j.cosrev.2016.12.001_br001050
  article-title: on some geometric methods in scheduling theory: A survey
  publication-title: Discrete Appl. Math.
  doi: 10.1016/0166-218X(94)90036-1
– volume: 11
  start-page: 1081
  issue: 4
  year: 2001
  ident: 10.1016/j.cosrev.2016.12.001_br000385
  article-title: Approximate max–min resource sharing for structured concave optimization
  publication-title: SIAM J. Optim.
  doi: 10.1137/S1052623499358689
– volume: 9
  start-page: 24
  issue: 3
  year: 2013
  ident: 10.1016/j.cosrev.2016.12.001_br000245
  article-title: Bin packing via discrepancy of permutations
  publication-title: ACM Trans. Algorithms
  doi: 10.1145/2483699.2483704
– volume: 2
  start-page: 147
  issue: 2
  year: 1981
  ident: 10.1016/j.cosrev.2016.12.001_br000200
  article-title: A tight asymptotic bound for next-fit-decreasing bin-packing
  publication-title: SIAM J. Algebr. Discrete Methods
  doi: 10.1137/0602019
– ident: 10.1016/j.cosrev.2016.12.001_br000260
  doi: 10.1109/FOCS.2012.23
– ident: 10.1016/j.cosrev.2016.12.001_br001020
– volume: 21
  start-page: 321
  issue: 2
  year: 1996
  ident: 10.1016/j.cosrev.2016.12.001_br001025
  article-title: Coordination complexity of parallel price-directive decomposition
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.21.2.321
– volume: 34
  start-page: 564
  issue: 5
  year: 2006
  ident: 10.1016/j.cosrev.2016.12.001_br000905
  article-title: Carathéodory bounds for integer cones
  publication-title: Oper. Res. Lett.
  doi: 10.1016/j.orl.2005.09.008
– ident: 10.1016/j.cosrev.2016.12.001_br000960
– volume: 23
  start-page: 749
  issue: 5
  year: 2008
  ident: 10.1016/j.cosrev.2016.12.001_br000765
  article-title: Approximation algorithms for 3D orthogonal knapsack
  publication-title: J. Comput. Sci. Technol.
  doi: 10.1007/s11390-008-9170-7
– start-page: 228
  year: 2006
  ident: 10.1016/j.cosrev.2016.12.001_br000550
  article-title: This side up!
– ident: 10.1016/j.cosrev.2016.12.001_br000875
  doi: 10.1137/1.9781611973068.73
– volume: 41
  start-page: 595
  issue: 9
  year: 2005
  ident: 10.1016/j.cosrev.2016.12.001_br000565
  article-title: Online square and cube packing
  publication-title: Acta Inform.
  doi: 10.1007/s00236-005-0169-z
– volume: 21
  start-page: 163
  issue: 2
  year: 1988
  ident: 10.1016/j.cosrev.2016.12.001_br001010
  article-title: Online algorithms for a dual version of bin packing
  publication-title: Discrete Appl. Math.
  doi: 10.1016/0166-218X(88)90052-2
– year: 1998
  ident: 10.1016/j.cosrev.2016.12.001_br000095
– ident: 10.1016/j.cosrev.2016.12.001_br000405
  doi: 10.1109/SFCS.2005.10
– volume: 1
  start-page: 349
  issue: 4
  year: 1981
  ident: 10.1016/j.cosrev.2016.12.001_br000185
  article-title: Bin packing can be solved within 1+epsilon in linear time
  publication-title: Combinatorica
  doi: 10.1007/BF02579456
– volume: 9
  start-page: 849
  issue: 6
  year: 1961
  ident: 10.1016/j.cosrev.2016.12.001_br000005
  article-title: A linear programming approach to the cutting-stock problem
  publication-title: Oper. Res.
  doi: 10.1287/opre.9.6.849
– volume: 6
  start-page: 310
  issue: 3
  year: 2009
  ident: 10.1016/j.cosrev.2016.12.001_br000640
  article-title: Rectangle packing with one-dimensional resource augmentation
  publication-title: Discrete Optim.
  doi: 10.1016/j.disopt.2009.04.001
– volume: 21
  start-page: 104
  issue: 1
  year: 1998
  ident: 10.1016/j.cosrev.2016.12.001_br001045
  article-title: On-line and off-line approximation algorithms for vector covering problems
  publication-title: Algorithmica
  doi: 10.1007/PL00009203
– ident: 10.1016/j.cosrev.2016.12.001_br000850
  doi: 10.1137/1.9781611974782.66
– volume: 93
  start-page: 241
  issue: 2
  year: 1991
  ident: 10.1016/j.cosrev.2016.12.001_br000155
  article-title: Completeness in approximation classes
  publication-title: Inform. Comput.
  doi: 10.1016/0890-5401(91)90025-W
– volume: 510
  start-page: 13
  year: 2013
  ident: 10.1016/j.cosrev.2016.12.001_br000210
  article-title: Tight absolute bound for first fit decreasing bin-packing: Ffd(l) ≤ 11/9 OPT(L) + 6/9
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/j.tcs.2013.09.007
– volume: 4
  start-page: 143
  issue: 2
  year: 2007
  ident: 10.1016/j.cosrev.2016.12.001_br000590
  article-title: Two-dimensional bin packing with one-dimensional resource augmentation
  publication-title: Discrete Optim.
  doi: 10.1016/j.disopt.2006.09.001
– ident: 10.1016/j.cosrev.2016.12.001_br000485
  doi: 10.1007/978-3-540-69903-3_28
– volume: 9
  start-page: 808
  issue: 4
  year: 1980
  ident: 10.1016/j.cosrev.2016.12.001_br000130
  article-title: Performance bounds for level-oriented two-dimensional packing algorithms
  publication-title: SIAM J. Comput.
  doi: 10.1137/0209062
– ident: 10.1016/j.cosrev.2016.12.001_br000390
  doi: 10.1007/978-3-642-10631-6_10
– volume: 32
  start-page: 5
  issue: 1
  year: 2004
  ident: 10.1016/j.cosrev.2016.12.001_br000720
  article-title: On the two-dimensional knapsack problem
  publication-title: Oper. Res. Lett.
  doi: 10.1016/S0167-6377(03)00057-9
– volume: 18
  start-page: 207
  issue: 2
  year: 1982
  ident: 10.1016/j.cosrev.2016.12.001_br000660
  article-title: Lower bounds for on-line two-dimensional packing algorithms
  publication-title: Acta Inform.
  doi: 10.1007/BF00264439
– volume: 39
  start-page: 1256
  issue: 4
  year: 2009
  ident: 10.1016/j.cosrev.2016.12.001_br000430
  article-title: A new approximation method for set covering problems, with applications to multidimensional bin packing
  publication-title: SIAM J. Comput.
  doi: 10.1137/080736831
– ident: 10.1016/j.cosrev.2016.12.001_br000140
  doi: 10.1109/SFCS.1982.61
– volume: 3
  start-page: 22
  issue: 2
  year: 2007
  ident: 10.1016/j.cosrev.2016.12.001_br000175
  article-title: The relative worst order ratio for online algorithms
  publication-title: ACM Trans. Algorithms (TALG)
  doi: 10.1145/1240233.1240245
– ident: 10.1016/j.cosrev.2016.12.001_br000995
  doi: 10.1109/FOCS.2015.39
– volume: 15
  start-page: 100
  issue: 1
  year: 1984
  ident: 10.1016/j.cosrev.2016.12.001_br000395
  article-title: Approximation algorithms for the m-dimensional 0–1 knapsack problem: Worst-case and probabilistic analyses
  publication-title: European J. Oper. Res.
  doi: 10.1016/0377-2217(84)90053-5
– ident: 10.1016/j.cosrev.2016.12.001_br000310
  doi: 10.1137/1.9781611973730.94
– ident: 10.1016/j.cosrev.2016.12.001_br000205
– volume: 28
  start-page: 217
  issue: 2
  year: 1992
  ident: 10.1016/j.cosrev.2016.12.001_br000105
  article-title: The pallet loading problem: A survey
  publication-title: Int. J. Prod. Econ.
  doi: 10.1016/0925-5273(92)90034-5
– ident: 10.1016/j.cosrev.2016.12.001_br000240
– ident: 10.1016/j.cosrev.2016.12.001_br000195
  doi: 10.1137/1.9781611974782.172
– ident: 10.1016/j.cosrev.2016.12.001_br000420
– volume: 4
  start-page: 339
  issue: 4
  year: 1979
  ident: 10.1016/j.cosrev.2016.12.001_br000860
  article-title: Fast approximation algorithms for knapsack problems
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.4.4.339
– start-page: 202
  year: 2000
  ident: 10.1016/j.cosrev.2016.12.001_br000975
  article-title: Online scheduling revisited
– ident: 10.1016/j.cosrev.2016.12.001_br001035
– volume: 123
  start-page: 333
  issue: 2
  year: 2000
  ident: 10.1016/j.cosrev.2016.12.001_br000870
  article-title: Approximation algorithms for knapsack problems with cardinality constraints
  publication-title: European J. Oper. Res.
  doi: 10.1016/S0377-2217(99)00261-1
– ident: 10.1016/j.cosrev.2016.12.001_br000465
  doi: 10.1145/1060590.1060702
– ident: 10.1016/j.cosrev.2016.12.001_br000915
– volume: 76
  start-page: 1077
  issue: 4
  year: 2016
  ident: 10.1016/j.cosrev.2016.12.001_br000930
  article-title: Approximating vector scheduling: Almost matching upper and lower bounds
  publication-title: Algorithmica
  doi: 10.1007/s00453-016-0116-0
– ident: 10.1016/j.cosrev.2016.12.001_br000470
  doi: 10.1007/11758471_21
– volume: 46
  start-page: 105
  issue: 2
  year: 2015
  ident: 10.1016/j.cosrev.2016.12.001_br000530
  article-title: SIGACT news online algorithms column 26: Bin packing in multiple dimensions
  publication-title: ACM SIGACT News
  doi: 10.1145/2789149.2789167
– start-page: 455
  year: 2013
  ident: 10.1016/j.cosrev.2016.12.001_br000100
  article-title: Bin packing approximation algorithms: Survey and classification
– year: 2001
  ident: 10.1016/j.cosrev.2016.12.001_br000145
– ident: 10.1016/j.cosrev.2016.12.001_br000520
– volume: 30
  start-page: 65
  issue: 3
  year: 1999
  ident: 10.1016/j.cosrev.2016.12.001_br000065
  article-title: Who is interested in algorithms and why?: lessons from the stony brook algorithms repository
  publication-title: ACM SIGACT News
  doi: 10.1145/333623.333627
– year: 1991
  ident: 10.1016/j.cosrev.2016.12.001_br000080
– ident: 10.1016/j.cosrev.2016.12.001_br000495
  doi: 10.1007/978-3-642-03367-4_35
– volume: 97
  start-page: 3
  issue: 1–2
  year: 2003
  ident: 10.1016/j.cosrev.2016.12.001_br000160
  article-title: Online algorithms: a survey
  publication-title: Math. Program.
  doi: 10.1007/s10107-003-0436-0
– volume: 27
  start-page: 207
  issue: 2
  year: 1980
  ident: 10.1016/j.cosrev.2016.12.001_br000805
  article-title: New algorithms for bin packing
  publication-title: J. ACM (JACM)
  doi: 10.1145/322186.322187
– volume: 21
  start-page: 257
  issue: 3
  year: 1976
  ident: 10.1016/j.cosrev.2016.12.001_br000820
  article-title: Resource constrained scheduling as generalized bin packing
  publication-title: J. Combin. Theory Ser. A
  doi: 10.1016/0097-3165(76)90001-7
– ident: 10.1016/j.cosrev.2016.12.001_br000360
– ident: 10.1016/j.cosrev.2016.12.001_br000320
  doi: 10.1109/SFCS.1991.185444
– volume: 4
  start-page: 185
  issue: 2
  year: 2007
  ident: 10.1016/j.cosrev.2016.12.001_br000575
  article-title: Bounds for online bounded space hypercube packing
  publication-title: Discrete Optim.
  doi: 10.1016/j.disopt.2006.11.005
– volume: 12
  start-page: 508
  issue: 3
  year: 1983
  ident: 10.1016/j.cosrev.2016.12.001_br000645
  article-title: Shelf algorithms for two-dimensional packing problems
  publication-title: SIAM J. Comput.
  doi: 10.1137/0212033
– volume: 45
  start-page: 1563
  issue: 9
  year: 1966
  ident: 10.1016/j.cosrev.2016.12.001_br000945
  article-title: Bounds for certain multiprocessing anomalies
  publication-title: Bell Syst. Tech. J.
  doi: 10.1002/j.1538-7305.1966.tb01709.x
– ident: 10.1016/j.cosrev.2016.12.001_br000790
– ident: 10.1016/j.cosrev.2016.12.001_br000340
  doi: 10.1109/ICC.2013.6655233
– volume: 20
  start-page: 93
  issue: 2
  year: 1997
  ident: 10.1016/j.cosrev.2016.12.001_br000235
  article-title: Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
  publication-title: Oper. Res. Lett.
  doi: 10.1016/S0167-6377(96)00047-8
– volume: 10
  start-page: 271
  issue: 3
  year: 1990
  ident: 10.1016/j.cosrev.2016.12.001_br000555
  article-title: Packing squares into a square
  publication-title: J. Parallel Distrib. Comput.
  doi: 10.1016/0743-7315(90)90019-L
– year: 2015
  ident: 10.1016/j.cosrev.2016.12.001_br000715
– ident: 10.1016/j.cosrev.2016.12.001_br000835
  doi: 10.1145/2488608.2488730
– volume: 21
  start-page: 19
  issue: 1
  year: 1994
  ident: 10.1016/j.cosrev.2016.12.001_br000120
  article-title: A branch-and-bound algorithm for the two-dimensional vector packing problem
  publication-title: Comput. Oper. Res.
  doi: 10.1016/0305-0548(94)90059-0
– volume: 5
  start-page: 502
  issue: 4
  year: 1984
  ident: 10.1016/j.cosrev.2016.12.001_br001005
  article-title: On a dual version of the one-dimensional bin packing problem
  publication-title: J. Algorithms
  doi: 10.1016/0196-6774(84)90004-X
– volume: 16
  start-page: 47
  issue: 1
  year: 2003
  ident: 10.1016/j.cosrev.2016.12.001_br000830
  article-title: On variable sized vector packing
  publication-title: Acta Cybern.
– ident: 10.1016/j.cosrev.2016.12.001_br000815
  doi: 10.1137/1.9781611973082.82
– volume: 35
  start-page: 39
  issue: 1
  year: 2015
  ident: 10.1016/j.cosrev.2016.12.001_br000780
  article-title: Packing anchored rectangles
  publication-title: Combinatorica
  doi: 10.1007/s00493-015-3006-1
– ident: 10.1016/j.cosrev.2016.12.001_br000255
  doi: 10.1137/1.9781611973099.32
– volume: 412
  start-page: 583
  issue: 7
  year: 2011
  ident: 10.1016/j.cosrev.2016.12.001_br000675
  article-title: Improved online algorithms for parallel job scheduling and strip packing
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/j.tcs.2009.05.033
– volume: 209
  start-page: 107
  issue: 1
  year: 1998
  ident: 10.1016/j.cosrev.2016.12.001_br000180
  article-title: Differential approximation algorithms for some combinatorial optimization problems
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/S0304-3975(97)00099-6
– volume: 13
  start-page: 149
  issue: 3
  year: 1993
  ident: 10.1016/j.cosrev.2016.12.001_br000505
  article-title: An on-line algorithm for multidimensional bin packing
  publication-title: Oper. Res. Lett.
  doi: 10.1016/0167-6377(93)90004-Z
– volume: 18
  start-page: 221
  issue: 2
  year: 2010
  ident: 10.1016/j.cosrev.2016.12.001_br000570
  article-title: A note on online hypercube packing
  publication-title: CEJOR Cent. Eur. J. Oper. Res.
  doi: 10.1007/s10100-009-0109-z
– ident: 10.1016/j.cosrev.2016.12.001_br000760
  doi: 10.1109/FOCS.2013.50
– volume: 47
  start-page: 248
  issue: 2
  year: 2014
  ident: 10.1016/j.cosrev.2016.12.001_br000605
  article-title: A (5/3+ϵ)-approximation for strip packing
  publication-title: Comput. Geom.
  doi: 10.1016/j.comgeo.2013.08.008
– ident: 10.1016/j.cosrev.2016.12.001_br000745
  doi: 10.1137/1.9781611974782.6
– year: 1971
  ident: 10.1016/j.cosrev.2016.12.001_br000015
– ident: 10.1016/j.cosrev.2016.12.001_br000935
  doi: 10.1109/FOCS.2013.57
– volume: 49
  start-page: 640
  issue: 5
  year: 2002
  ident: 10.1016/j.cosrev.2016.12.001_br000290
  article-title: On the online bin packing problem
  publication-title: J. ACM (JACM)
  doi: 10.1145/585265.585269
– ident: 10.1016/j.cosrev.2016.12.001_br000295
– volume: 45
  start-page: 76
  issue: 4
  year: 2014
  ident: 10.1016/j.cosrev.2016.12.001_br000785
  article-title: Computational geometry column 60
  publication-title: SIGACT News
  doi: 10.1145/2696081.2696096
– volume: 10
  start-page: 305
  issue: 3
  year: 1989
  ident: 10.1016/j.cosrev.2016.12.001_br000285
  article-title: On-line bin packing in linear time
  publication-title: J. Algorithms
  doi: 10.1016/0196-6774(89)90031-X
– ident: 10.1016/j.cosrev.2016.12.001_br000755
  doi: 10.1137/1.9781611973730.98
– year: 2015
  ident: 10.1016/j.cosrev.2016.12.001_br000880
SSID ssj0070056
Score 2.5373569
SecondaryResourceType review_article
Snippet The bin packing problem is a well-studied problem in combinatorial optimization. In the classical bin packing problem, we are given a list of real numbers in...
SourceID crossref
elsevier
SourceType Enrichment Source
Index Database
Publisher
StartPage 63
SubjectTerms Approximation algorithms
Bin packing
Geometric packing
Multidimensional packing and covering
Multidimensional scheduling
Online algorithms
Title Approximation and online algorithms for multidimensional bin packing: A survey
URI https://dx.doi.org/10.1016/j.cosrev.2016.12.001
Volume 24
WOSCitedRecordID wos000405622300004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1876-7745
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0070056
  issn: 1574-0137
  databaseCode: AIEXJ
  dateStart: 20070801
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV07b9swECbcpEOXNn2haZOCQzdBhV40qWxCkKLpYBSoC3gTSIpsHDtyIMuGf0F_d44iqdhJkTZDF8EQLFLSfbo7Hu--Q-gToVwYIrJQ6KEIM7CRIZeShGSoaMbUUHEqu2YTdDRik0n-fTD47Wth1nNa12yzya__q6jhHAjblM4-Qtz9oHACfoPQ4Qhih-M_Cb4wLOGbqS1J7PYGLBtGwOe_Fs20vbAUDDaVsDLk_paYIxAdzaqcuRLoIliumvXutq_vARH4aqBmZ2vBMhWo2kV1TAHEdBacf-61-oUNtxaNiQRc9Wp5MVu11ov9ocCstluQHStD0dj5ug1f8mo7SgES73MCvWKlJtvFErx4zZtkW6rT6TlrhG2DmXvq3UYaLkE6S9OhByYadsFcN9MOm_YdK9fnHvq0tsvSjlKaUco4Mdl9T9B-QkkOCn6_OD-bfPM2nRrG1I551z2FL8LsMgXv382fnZwtx2V8gJ67FQcuLFJeooGqX6EXXpLYKffXaLQDHAzAwRY4-BY4GICD7wIHA3CwA84JLrCFzRv088vZ-PRr6LpthBKWjW2omIYH40RWJBEZUVEuWKq1TpkSiRaKx5USokppljMOn3EiSayjimcqSTUjIn2L9upFrd4hLFMCGiCXOuNRVgnG4ljmXMJagEZU8ugQpf71lNJR0ZuOKPPyIeEcorC_6tpSsfzl_9S_-dJ9FdZNLAFOD175_pEzfUDPbjF_hPbaZqWO0VO5bqfL5qPD0g0Idp2v
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Approximation+and+online+algorithms+for+multidimensional+bin+packing%3A+A+survey&rft.jtitle=Computer+science+review&rft.au=Christensen%2C+Henrik+I.&rft.au=Khan%2C+Arindam&rft.au=Pokutta%2C+Sebastian&rft.au=Tetali%2C+Prasad&rft.date=2017-05-01&rft.issn=1574-0137&rft.volume=24&rft.spage=63&rft.epage=79&rft_id=info:doi/10.1016%2Fj.cosrev.2016.12.001&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_cosrev_2016_12_001
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1574-0137&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1574-0137&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1574-0137&client=summon