@misc{packomania,
author = {Eckard Specht},
title = {Packomania},
howpublished = {\url{http://www.packomania.com/}},
note = {Accessed: 2017-03-06}
}
@article{1968-meir-moser,
author = {Meir, A. and Moser, L.},
title = {{On packing of squares and cubes}},
journal = {{Journal of Combinatorial Theory}},
year = {1968},
volume = {5},
pages = {126--134},
number = {2},
doi = {10.1016/S0021-9800(68)80047-X}
}
@article{1980-baker-etal,
author = {Brenda S. Baker and Edward G. Coffman, Jr. and Ronald L. Rivest},
title = {{Orthogonal Packings in Two Dimensions}},
journal = {{SIAM Journal on Computing}},
volume = {9},
number = {4},
pages = {846--855},
year = {1980},
doi = {10.1137/0209064}
}
@article{1980-coffman-etal,
author = {Edward G. Coffman, Jr. and Michael R. Garey and David S. Johnson
and Robert E. Tarjan},
title = {{Performance Bounds for Level-Oriented Two-Dimensional Packing
Algorithms}},
journal = {{SIAM Journal on Computing}},
volume = {9},
number = {4},
pages = {808--826},
year = {1980},
doi = {10.1137/0209062}
}
@article{1980-sleator,
author = {Daniel Dominic Kaplan Sleator},
title = {{A 2.5 times optimal algorithm for packing in two dimensions}},
journal = {{Information Processing Letters}},
year = {1980},
volume = {10},
pages = {37--40},
number = {1},
doi = {10.1016/0020-0190(80)90121-0}
}
@inbook{1981-garey-johnson,
author = {Michael R. Garey and David S. Johnson},
editor = {G. Ausiello and M. Lucertini},
title = {{Approximation Algorithms for Bin Packing Problems: A Survey}},
booktitle = {{Analysis and Design of Algorithms in Combinatorial
Optimization}},
year = {1981},
publisher = {Springer Vienna},
address = {Vienna},
pages = {147--172},
doi = {10.1007/978-3-7091-2748-3_8}
}
@article{1981-lavega-lueker,
author = {Wenceslas {Fernandez de la Vega} and George S. Lueker},
title = {{Bin packing can be solved within \hbox{1 + $\varepsilon$} in linear
time}},
journal = {{Combinatorica}},
year = {1981},
volume = {1},
pages = {349--355},
number = {4},
doi = {10.1007/BF02579456},
publisher = {Springer-Verlag}
}
@article{1982-chung-etal,
author = {F. Chung and Michael R. Garey and David S. Johnson},
title = {{On Packing Two-Dimensional Bins}},
journal = {SIAM Journal on Algebraic Discrete Methods},
year = {1982},
volume = {3},
pages = {66--76},
number = {1},
doi = {10.1137/0603007}
}
@inbook{1984-coffman-etal,
author = {Edward G. Coffman and Michael R. Garey and David S. Johnson},
editor = {G. Ausiello and M. Lucertini and P. Serafini},
title = {{Approximation Algorithms for Bin-Packing - An Updated Survey}},
booktitle = {{Algorithm Design for Computer System Design}},
year = {1984},
publisher = {Springer Vienna},
address = {Vienna},
pages = {49--106},
doi = {10.1007/978-3-7091-4338-4_3}
}
@article{1990-li-cheng,
author = {Li, K. and Cheng, K.},
title = {{On Three-Dimensional Packing}},
journal = {{SIAM Journal on Computing}},
year = {1990},
volume = {19},
pages = {847--867},
number = {5},
doi = {10.1137/0219059}
}
@inproceedings{1994-schiermeyer,
author = {Ingo Schiermeyer},
title = {{Reverse-Fit: A 2-optimal algorithm for packing rectangles}},
booktitle = {{Proceedings of the 2nd Annual European Symposium on Algorithms
(ESA'1994)}},
year = {1994},
pages = {290--299},
doi = {10.1007/BFb0049416}
}
@article{1995-george-etal,
author = {George, J. A. and George, J. M. and Lamar, B. W.},
title = {{Packing different-sized circles into a rectangular container}},
journal = {{European Journal of Operational Research}},
year = {1995},
volume = {84},
pages = {693--712},
number = {3},
doi = {10.1016/0377-2217(95)00032-L}
}
@article{1995-galambos-woeginger,
author = {G\'{a}bor Galambos and Gerhard J. Woeginger},
title = {{On-line Bin Packing - A Restricted Survey}},
journal = {{Zeitschrift f\"{u}r Operations Research}},
volume = {42},
number = {1},
pages = {25--45},
year = {1995},
doi = {10.1007/BF01415672}
}
@techreport{1995-oh-son,
author = {Yingfeng Oh and Sang H. Son},
title = {{On a Constrained Bin-packing Problem}},
year = {1995},
publisher = {University of Virginia},
address = {Charlottesville, VA, USA}
}
@article{1997-miyazawa-wakabayashi,
author = {Miyazawa, F.K. and Wakabayashi, Y.},
title = {{An algorithm for the three-dimensional packing problem with
asymptotic performance analysis}},
journal = {{Algorithmica}},
year = {1997},
volume = {18},
pages = {122--144},
number = {1},
doi = {10.1007/BF02523692}
}
@article{1997-steinberg,
author = {Steinberg, A.},
title = {{A Strip-Packing Algorithm with Absolute Performance Bound 2}},
journal = {{SIAM Journal on Computing}},
year = {1997},
volume = {26},
pages = {401--409},
number = {2},
doi = {10.1137/S0097539793255801}
}
@article{1997-jansen-ohring,
author = {Klaus Jansen and Sabine \"{O}hring},
title = {{Approximation Algorithms for Time Constrained Scheduling}},
journal = {{Information and Computation}},
volume = {132},
number = {2},
year = {1997},
pages = {85--108},
doi = {10.1006/inco.1996.2616},
publisher = {Academic Press, Inc.},
address = {Duluth, MN, USA}
}
@article{1997-csirik-woeginger,
author = {J\'{a}nos Csirik and Gerhard J. Woeginger},
title = {{Shelf Algorithms for On-line Strip Packing}},
journal = {{Information Processing Letters}},
volume = {63},
number = {4},
pages = {171--175},
year = {1997},
doi = {10.1016/S0020-0190(97)00120-8}
}
@article{1999-jansen,
author = {Klaus Jansen},
title = {{An Approximation Scheme for Bin Packing with Conflicts}},
journal = {{Journal of Combinatorial Optimization}},
volume = {3},
number = {4},
pages = {363--377},
year = {1999},
doi = {10.1023/A:1009871302966}
}
@article{2000-miyazawa-wakabayashi,
author = {Miyazawa, F. and Wakabayashi, Y.},
title = {{Approximation Algorithms for the Orthogonal z-Oriented
Three-Dimensional Packing Problem}},
journal = {{SIAM Journal on Computing}},
year = {2000},
volume = {29},
pages = {1008--1029},
number = {3},
doi = {10.1137/S009753979631391X}
}
@inproceedings{2002-caprara,
author = {Caprara, A},
title = {{Packing 2-dimensional bins in harmony}},
booktitle = {{Proceedings of the 43rd Annual IEEE Symposium on Foundations of
Computer Science (FOCS'2002)}},
year = {2002},
pages = {490--499},
doi = {10.1109/SFCS.2002.1181973}
}
@article{2002-seiden,
author = {Steven S. Seiden},
title = {{On the Online Bin Packing Problem}},
journal = {Journal of the ACM},
volume = {49},
number = {5},
year = {2002},
pages = {640--671},
publisher = {ACM},
doi = {10.1007/3-540-48224-5_20},
address = {New York, NY, USA}
}
@article{2002-lodi-etal,
author = {Andrea Lodi and Silvano Martello and Michele Monaci},
title = {{Two-dimensional Packing Problems: A Survey}},
journal = {{European Journal of Operational Research}},
volume = {141},
number = {2},
pages = {241--252},
year = {2002},
doi = {10.1016/S0377-2217(02)00123-6}
}
@article{2004-gendreau-etal,
author = {Michel Gendreau and Gilbert Laporte and Fr\'{e}d\'{e}ric Semet},
title = {{Heuristics and Lower Bounds for the Bin Packing Problem with
Conflicts}},
journal = {{Computers \& Operations Research}},
volume = {31},
number = {3},
pages = {347--358},
year = {2004},
doi = {10.1016/S0305-0548(02)00195-8}
}
@article{2004-kohayakawa-etal,
author = {Kohayakawa, Y. and Miyazawa, F. and Raghavan, P. and Wakabayashi,
Y.},
title = {{Multidimensional Cube Packing}},
journal = {Algorithmica},
year = {2004},
volume = {40},
pages = {173--187},
number = {3},
doi = {10.1007/s00453-004-1102-5}
}
@inproceedings{2005-jansen-vanstee,
author = {Klaus Jansen and Rob van Stee},
title = {{On Strip Packing With Rotations}},
booktitle = {{Proceedings of the 37th Annual ACM Symposium on Theory of
Computing (STOC'2005)}},
year = {2005},
pages = {755--761},
doi = {10.1145/1060590.1060702},
publisher = {ACM},
address = {New York, NY, USA}
}
@article{2005-epstein-vanstee,
author = {Leah Epstein and Rob van Stee},
title = {{Optimal Online Algorithms for Multidimensional Packing Problems}},
journal = {{SIAM Journal on Computing}},
volume = {35},
number = {2},
pages = {431--448},
year = {2005},
doi = {10.1137/S0097539705446895}
}
@techreport{2005-mccloskey-shankar,
author = {Bill McCloskey and AJ Shankar},
title = {{Approaches to Bin Packing with Clique-Graph Conflicts}},
year = {2005},
publisher = {University of California},
address = {Berkeley, CA, USA}
}
@article{2006-bansal-etal,
author = {Nikhil Bansal and Jos R. Correa and Claire Kenyon and Maxim Sviridenko},
title = {{Bin Packing in Multiple Dimensions: Inapproximability Results and
Approximation Schemes}},
journal = {{Mathematics of Operations Research}},
volume = {31},
number = {1},
year = {2006},
pages = {31--49},
doi = {10.1287/moor.1050.0168},
publisher = {INFORMS},
address = {Institute for Operations Research and the Management Sciences (INFORMS), Linthicum, Maryland, USA}
}
@incollection{2006-chlebik-chlebikova,
author = {Chleb{\'i}k, Miroslav and Chleb{\'i}kov{\'a}, Janka},
title = {{Inapproximability Results for Orthogonal Rectangle Packing Problems
with Rotations}},
booktitle = {{Algorithms and Complexity}},
publisher = {Springer Berlin Heidelberg},
year = {2006},
editor = {Calamoneri, Tiziana and Finocchi, Irene and Italiano, GiuseppeF.},
volume = {3998},
series = {Lecture Notes in Computer Science},
pages = {199-210},
doi = {10.1007/11758471_21}
}
@article{2006-epstein-vanstee,
author = {Leah Epstein and Rob van Stee},
title = {{This Side Up!}},
journal = {{ACM Transactions on Algorithms}},
volume = {2},
number = {2},
year = {2006},
pages = {228--243},
doi = {10.1145/1150334.1150339},
publisher = {ACM},
address = {New York, NY, USA}
}
@inproceedings{2006-jansen-solisoba,
author = {Jansen, K. and Solis-Oba, R.},
title = {{An Asymptotic Approximation Algorithm for 3D-strip Packing}},
booktitle = {{Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete
Algorithm (SODA'2006)}},
year = {2006},
pages = {143--152},
doi = {10.1145/1109557.1109575}
}
@book{2007-szabo-etal,
title = {{New Approaches to Circle Packing in a Square}},
author = {P\'{e}ter G\'{a}bor Szab\'{o} and Mihaly Csaba Mark\'{o}t and
Tibor Csendes and Eckard Specht and Leocadio G. Casado and
Inmaculada Garc\'{i}a},
series = {{Springer Optimization and Its Applications}},
year = {2007},
publisher = {{Springer US}},
address = {New York, USA}
}
@article{2007-jansen-zhang,
author = {Jansen, Klaus and Zhang, Guochuan},
title = {{Maximizing the Total Profit of Rectangles Packed into a Rectangle}},
journal = {{Algorithmica}},
volume = {47},
number = {3},
year = {2007},
pages = {323--342},
doi = {10.1007/s00453-006-0194-5},
publisher = {Springer-Verlag New York, Inc.},
address = {Secaucus, NJ, USA}
}
@inbook{2008-harren-vanstee,
author = {Rolf Harren and Rob van Stee},
editor = {Joachim Gudmundsson},
title = {{Packing Rectangles into 2OPT Bins Using Rotations}},
booktitle = {{Proceedings of the 11th Scandinavian Workshop on Algorithm Theory, SWAT'2008}},
year = {2008},
publisher = {Springer Berlin Heidelberg},
address = {Berlin, Heidelberg},
pages = {306--318},
doi = {10.1007/978-3-540-69903-3_28}
}
@article{2008-epstein-levin,
author = {Leah Epstein and Asaf Levin},
year = {2008},
title = {{On Bin Packing with Conflicts}},
journal = {SIAM Journal on Optimization},
volume = {19},
number = {3},
pages = {1270--1298},
doi = {10.1137/060666329}
}
@article{2008-epstein-etal,
author = {Leah Epstein and Asaf Levin and Rob van Stee},
title = {{Two-dimensional Packing with Conflicts}},
journal = {{Acta Informatica}},
year = {2008},
volume = {45},
number = {3},
pages = {155--175},
doi = {10.1007/s00236-007-0067-7}
}
@article{2008-caprara,
author = {Caprara, Alberto},
title = {{Packing d-Dimensional Bins in d Stages}},
journal = {{Mathematics of Operations Research}},
year = {2008},
volume = {33},
pages = {203--215},
number = {1},
doi = {10.1287/moor.1070.0289}
}
@article{2009-augustine-etal,
author = {John Augustine and Sudarshan Banerjee and Sandy Irani},
title = {{Strip Packing with Precedence Constraints and Strip Packing with Release Times}},
journal = {{Theoretical Computer Science}},
volume = {410},
number = {38-40},
pages = {3792--3803},
year = {2009},
doi = {10.1016/j.tcs.2009.05.024}
}
@inbook{2009-harren-vanstee,
author = {Rolf Harren and Rob van Stee},
editor = {Irit Dinur and Klaus Jansen and Joseph Naor and Jos\'{e} Rolim},
title = {{Improved Absolute Approximation Ratios for Two-Dimensional Packing
Problems}},
booktitle = {{Proceedings of the 12th International Workshop on
Approximation Algorithms for Combinatorial Optimization Problems
(APPROX'2009) and the 13th International Workshop on
Randomization and Computation (RANDOM'2009)}},
year = {2009},
publisher = {Springer Berlin Heidelberg},
address = {Berlin, Heidelberg},
pages = {177--189},
doi = {10.1007/978-3-642-03685-9_14}
}
@inbook{2009-jansen-etal,
author = {Klaus Jansen and Lars Pr\"{a}del and Ulrich M. Schwarz},
editor = {Frank Dehne and Marina Gavrilova and J\"{o}rg-R\"{u}diger and Sack
Csaba D. T\'{o}th},
title = {{Two for One: Tight Approximation of 2D Bin Packing}},
booktitle = {{Proceedings of the 11th International Symposium on Algorithms
and Data Structures, WADS'2009}},
year = {2009},
publisher = {Springer Berlin Heidelberg},
address = {Berlin, Heidelberg},
pages = {399--410},
doi = {10.1007/978-3-642-03367-4_35}
}
@article{2009-riff-etal,
author = {Mar\'{i}a Cristina Riff and Xavier Bonnaire and Bertrand Neveu},
title = {{A Revision of Recent Approaches for Two-dimensional Strip-packing Problems}},
journal = {{Engineering Applications of Artificial Intelligence}},
volume = {22},
number = {4-5},
pages = {823--827},
year = {2009},
doi = {10.1016/j.engappai.2008.10.025}
}
@article{2009-friedman,
author = {Erich Friedman},
title = {{Packing Unit Squares in Squares: A Survey and New Results}},
journal = {{The Electronic Journal of Combinatorics}},
pages = {24},
volume = {DS7},
year = {2009},
doi = {10.1016/j.engappai.2008.10.025}
}
@article{2009-hifi-mhallah,
author = {Hifi, M. and M'Hallah, R.},
title = {{A Literature Review on Circle and Sphere Packing Problems: Models
and Methodologies}},
journal = {{Advances in Operations Research}},
year = {2009},
volume = {2009},
pages = {1--22},
doi = {10.1155/2009/150624}
}
@article{2010-bansal-etal,
author = {Bansal, N. and Caprara, A. and Sviridenko, M.},
title = {{A New Approximation Method for Set Covering Problems, with
Applications to Multidimensional Bin Packing}},
journal = {{SIAM Journal on Computing}},
year = {2010},
volume = {39},
pages = {1256--1278},
number = {4},
doi = {10.1137/080736831}
}
@article{2010-birgin-gentil,
author = {Birgin, E. G. and Gentil, J. M.},
title = {{New and improved results for packing identical unitary radius
circles within triangles, rectangles and strips}},
journal = {{Computers and Operations Research}},
year = {2010},
volume = {37},
pages = {1318--1327},
number = {7},
doi = {10.1016/j.cor.2009.09.017}
}
@article{2010-khanafer-etal,
author = {Ali Khanafer and Fran\c{c}ois Clautiaux and El-Ghazali Talbi},
title = {{New Lower Bounds for Bin Packing Problems with Conflicts}},
journal = {{European Journal of Operational Research}},
volume = {206},
number = {2},
pages = {281--288},
year = {2010},
doi = {10.1016/j.ejor.2010.01.037}
}
@article{2010-muritiba-etal,
author = {Albert E. Fernandes Muritiba and Manuel Iori and Enrico Malaguti and
Paolo Toth},
title = {{Algorithms for the Bin Packing Problem with Conflicts}},
journal = {{INFORMS Journal on Computing}},
volume = {22},
number = {3},
year = {2010},
pages = {401--415},
doi = {10.1287/ijoc.1090.0355},
publisher = {INFORMS},
address = {Linthicum, Maryland, USA}
}
@article{2010-epstein,
title = {{Two-dimensional Online Bin Packing with Rotation}},
journal = {{Theoretical Computer Science}},
volume = {411},
number = {31},
pages = {2899--2911},
year = {2010},
author = {Leah Epstein},
doi = {10.1016/j.tcs.2010.04.021}
}
@inbook{2010-demaine-etal,
author = {Erik D. Demaine and S{\'a}ndor P. Fekete and Robert J. Lang},
editor = {Mark Yim},
title = {{Circle Packing for Origami Design Is Hard}},
booktitle = {{Origami5: Proceedings of the 5th International Conference on
Origami in Science, Mathematics and Education (OSME'2010)}},
year = {2010},
publisher = {A K Peters/CRC Press},
address = {Singapore},
pages = {609--626},
doi = {10.1201/b10971-52}
}
@article{2010-han-etal,
author = {Han, Xin and Ye, Deshi and Zhou, Yong},
title = {{A note on online hypercube packing}},
journal = {{Central European Journal of Operations Research}},
year = {2010},
volume = {18},
number = {2},
pages = {221--239},
doi = {10.1007/s10100-009-0109-z}
}
@article{2011-han-etal,
author = {Xin Han and Francis Y. L. Chin and Hing-Fung Ting and Guochuan
Zhang and Yong Zhang},
title = {{A New Upper Bound 2.5545 on 2D Online Bin Packing}},
journal = {{ACM Transactions on Algorithms}},
volume = {7},
number = {4},
year = {2011},
pages = {50:1--50:18},
doi = {10.1145/2000807.2000818},
publisher = {ACM},
address = {New York, NY, USA}
}
@article{2011-elhedhli-etal,
author = {Samir Elhedhli and Lingzi Li and Mariem Gzara and Joe Naoum-Sawaya},
title = {{A Branch-and-Price Algorithm for the Bin Packing Problem with
Conflicts}},
journal = {{INFORMS Journal on Computing}},
volume = {23},
number = {3},
pages = {404--415},
year = {2011},
doi = {10.1287/ijoc.1100.0406}
}
@article{2011-epstein-etal,
author = {Leah Epstein and Lene M. Favrholdt and Asaf Levin},
title = {{Online Variable-sized Bin Packing with Conflicts}},
journal = {{Discrete Optimization}},
volume = {8},
number = {2},
pages = {333--343},
year = {2011},
doi = {10.1016/j.disopt.2010.11.001}
}
@article{2011-maiza-radjef,
author = {Mohamed Maiza and Mohammed Said Radjef},
title = {{Heuristics for Solving the Bin-Packing Problem with Conflicts}},
journal = {Applied Mathematical Sciences},
year = {2011},
volume = {5},
number = {35},
pages = {1739--1752}
}
@article{2012-dellamico-etal,
author = {Mauro Dell'Amico and Jos\'{e} C. D. D\'{i}az and Manuel
Iori},
title = {{The Bin Packing Problem with Precedence Constraints}},
journal = {{Operations Research}},
volume = {60},
number = {6},
pages = {1491--1504},
year = {2012},
doi = {10.1287/opre.1120.1109}
}
@article{2012-harren-vanstee,
author = {Harren, R. and van Stee, R.},
title = {{Absolute approximation ratios for packing rectangles into bins}},
journal = {{Journal of Scheduling}},
year = {2012},
volume = {15},
pages = {63--75},
number = {1},
doi = {10.1007/s10951-009-0110-3}
}
@article{2012-khanafer-etal,
author = {Ali Khanafer and Fran\c{c}ois Clautiaux and El-Ghazali Talbi},
title = {{Tree-decomposition Based Heuristics for the Two-dimensional Bin
Packing Problem with Conflicts}},
journal = {{Computers \& Operations Research}},
volume = {39},
number = {1},
pages = {54--63},
year = {2012},
doi = {10.1016/j.cor.2010.07.009}
}
@article{2012-hamdidhaoui-etal,
author = {Khaoula Hamdi-Dhaoui and Nacima Labadie and Alice Yalaoui},
title = {{Algorithms for the Two Dimensional Bin Packing Problem with
Partial Conflicts}},
journal = {{RAIRO - Operations Research}},
volume = {46},
year = {2012},
pages = {41--62},
doi = {10.1051/ro/2012007}
}
@article{2013-sadykov-vanderbeck,
author = {Ruslan Sadykov and Fran\c{c}ois Vanderbeck},
title = {{Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm}},
journal = {{INFORMS Journal on Computing}},
volume = {25},
number = {2},
pages = {244--255},
year = {2013},
doi = {10.1287/ijoc.1120.0499}
}
@article{2013-silveira-etal,
title = {{Heuristics for the Strip Packing Problem with Unloading Constraints}},
author = {Jefferson L.M. da Silveira and Fl\'{a}vio K. Miyazawa and Eduardo
C. Xavier},
journal = {{Computers \& Operations Research}},
volume = {40},
number = {4},
pages = {991--1003},
year = {2013},
doi = {10.1016/j.cor.2012.11.003}
}
@article{2013-bansal-etal,
author = {Bansal, N. and Han, X. and Iwama, K. and Sviridenko, M. and Zhang,
G.},
title = {{A Harmonic Algorithm for the 3D Strip Packing Problem}},
journal = {{SIAM Journal on Computing}},
year = {2013},
volume = {42},
pages = {579--592},
number = {2},
doi = {10.1137/070691607}
}
@inbook{2013-coffman-etal,
author = {Edward G. Coffman and J\'{a}nos Csirik and G\'{a}bor Galambos and
Silvano Martello and Daniele Vigo},
editor = {M. Panos Pardalos and Ding-Zhu Du and L. Ronald Graham},
title = {{Bin Packing Approximation Algorithms: Survey and
Classification}},
booktitle = {{Handbook of Combinatorial Optimization}},
year = {2013},
publisher = {Springer New York},
address = {New York, NY},
pages = {455--531},
doi = {10.1007/978-1-4419-7997-1_35}
}
@inbook{2013-lodi-etal,
title = {{Two-Dimensional Bin Packing Problems}},
author = {Andrea Lodi and Silvano Martello and Michele Monaci and Daniele Vigo},
publisher = {John Wiley \& Sons, Inc.},
doi = {10.1002/9781118600207.ch5},
pages = {107--129},
booktitle = {{Paradigms of Combinatorial Optimization}},
year = {2013}
}
@inproceedings{2014-bansal-khan,
author = {Nikhil Bansal and Arindam Khan},
title = {{Improved Approximation Algorithm for Two-dimensional Bin Packing}},
booktitle = {{Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete
Algorithms (SODA'2014)}},
year = {2014},
pages = {13--25},
publisher = {SIAM}
}
@article{2014-harren-etal,
author = {Rolf Harren and Klaus Jansen and Lars Pr\"{a}del and Rob van Stee},
title = {{A $(5/3+\epsilon)$-approximation for Strip Packing}},
journal = {{Computational Geometry}},
volume = {47},
number = {2, Part B},
pages = {248--267},
year = {2014},
doi = {10.1016/j.comgeo.2013.08.008}
}
@incollection{2014a-jansen-pradel,
author = {Jansen, Klaus and Pr{\"a}del, Lars},
title = {{A New Asymptotic Approximation Algorithm for 3-Dimensional Strip
Packing}},
booktitle = {{SOFSEM 2014: Theory and Practice of Computer Science}},
publisher = {Springer International Publishing},
year = {2014},
editor = {Geffert, Viliam and Preneel, Bart and Rovan, Branislav and
{\vS}tuller, J{\'u}lius and Tjoa, AMin},
volume = {8327},
series = {Lecture Notes in Computer Science},
pages = {327--338},
doi = {10.1007/978-3-319-04298-5_29}
}
@article{2014-silveira-etal,
author = {Jefferson L.M. da Silveira and Eduardo C. Xavier and Fl\'{a}vio K. Miyazawa},
title = {{Two-dimensional Strip Packing with Unloading Constraints}},
journal = {{Discrete Applied Mathematics}},
volume = {164, Part 2},
pages = {512--521},
year = {2014},
doi = {10.1016/j.dam.2013.08.019}
}
@article{2014-cote-etal,
title = {{An Exact Algorithm for the Two-Dimensional Orthogonal Packing
Problem with Unloading Constraints}},
author = {Jean-François C{\^o}t{\'e} and Michel Gendreau and Jean-Yves Potvin},
journal = {{Operations Research}},
volume = {62},
number = {5},
pages = {1126--1141},
year = {2014},
doi = {10.1287/opre.2014.1307}
}
@article{2014b-jansen-pradel,
author = {Jansen, Klaus and Pr{\"a}del, Lars},
title = {{New Approximability Results for Two-Dimensional Bin Packing}},
journal = {Algorithmica},
year = {2014},
pages = {1--62},
doi = {10.1007/s00453-014-9943-z}
}
@article{2015-tatarevic,
author = {Milos Tatarevic},
title = {{On Limits of Dense Packing of Equal Spheres in a Cube}},
journal = {{The Electronic Journal of Combinatorics}},
pages = {35},
volume = {22},
number = {1},
year = {2015}
}
@inbook{2015-balogh-etal,
author = {J\'{a}nos Balogh and J\'{o}zsef B\'{e}k\'{e}si and Gy\"{o}rgy
D\'{o}sa and Ji\v r\'{i} Sgall and Rob van Stee},
title = {{The Optimal Absolute Ratio for Online Bin Packing}},
booktitle = {{Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete
Algorithms, SODA'2015}},
chapter = {94},
pages = {1425--1438},
doi = {10.1137/1.9781611973730.94},
year = {2015}
}
@techreport{2015-delorme-etal,
author = {Maxence Delorme and Manuel Iori and Silvano Martello},
title = {{Bin Packing and Cutting Stock Problems: Mathematical Models and
Exact Algorithms}},
year = {2015},
publisher = {University of Bologna},
address = {Bologna, Italy}
}
@inproceedings{2015-kamali-etal,
title = {{Online Packing of Equilateral Triangles}},
author = {Shahin Kamali and Alejandro L{\'o}pez-Ortiz and Zahed Rahmati},
booktitle = {{Proceedings of the 27th Canadian Conference on Computational
Geometry (CCCG'2015)}},
year = {2015}
}
@article{2016-hokama-etal,
author = {Pedro Hokama and Fl\'{a}vio Keidi Miyazawa and Rafael Crivellari
Saliba Schouery},
title = {{A Bounded Space Algorithm for Online Circle Packing}},
journal = {Information Processing Letters},
volume = {116},
number = {5},
year = {2016},
pages = {337--342},
publisher = {Elsevier North-Holland, Inc.},
address = {Amsterdam, The Netherlands, The Netherlands},
doi = {10.1016/j.ipl.2015.12.007}
}
@article{2016-miyazawa-etal,
author = {Fl{\'a}vio Keidi Miyazawa and Lehilton Lelis Chaves Pedrosa and
Rafael Crivellari Saliba Schouery and Maxim Sviridenko and Yoshiko
Wakabayashi},
title = {{Polynomial-Time Approximation Schemes for Circle and Other Packing
Problems}},
journal = {{Algorithmica}},
year = {2016},
volume = {76},
number = {2},
pages = {536--568},
doi = {10.1007/s00453-015-0052-4}
}
@article{2016-pereira,
author = {Jordi Pereira},
title = {{Procedures for the Bin Packing Problem with Precedence
Constraints}},
journal = {{European Journal of Operational Research}},
volume = {250},
number = {3},
pages = {794--806},
year = {2016},
doi = {10.1016/j.ejor.2015.10.048}
}
@inproceedings{2016-heidrich-vanstee,
author = {Sandy Heydrich and Rob van Stee},
title = {{Beating the Harmonic Lower Bound for Online Bin Packing}},
booktitle = {{Proceedings of the 43rd International Colloquium on Automata,
Languages, and Programming (ICALP'2016)}},
pages = {41:1--41:14},
series = {{Leibniz International Proceedings in Informatics (LIPIcs)}},
year = {2016},
volume = {55},
editor = {Ioannis Chatzigiannakis and Michael Mitzenmacher and Yuval Rabani and Davide Sangiorgi},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
doi = {10.4230/LIPIcs.ICALP.2016.41}
}
@article{2017-christensen-etal,
title = {{Approximation and online algorithms for multidimensional bin
packing: A survey}},
journal = {{Computer Science Review}},
volume = {24},
pages = {63--79},
year = {2017},
doi = {10.1016/j.cosrev.2016.12.001},
author = {Henrik I. Christensen and Arindam Khan and Sebastian Pokutta and
Prasad Tetali}
}
@inbook{2017-hoberg-rothboss,
author = {Rebecca Hoberg and Thomas Rothvoss},
title = {{A Logarithmic Additive Integrality Gap for Bin Packing}},
booktitle = {{Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete
Algorithms (SODA'2017)}},
pages = {2616--2625},
year = {2017},
doi = {10.1137/1.9781611974782.172}
}
@article{1993-castillo-daganzo,
author = {Bernardo de Castillo and Carlos F. Daganzo},
title = {{Handling Strategies for Import Containers at Marine Terminals}},
journal = {{Transportation Research Part B: Methodological}},
volume = {27},
number = {2},
pages = {151--166},
year = {1993},
doi = {10.1016/0191-2615(93)90005-U}
}
@article{1997-kim,
author = {Kap Hwan Kim},
title = {{Evaluation of the Number of Rehandles in Container Yards}},
journal = {{Computers \& Industrial Engineering}},
volume = {32},
number = {4},
pages = {701--711},
year = {1997},
doi = {10.1016/S0360-8352(97)00024-7}
}
@article{2000-kim-etal,
author = {Kap H. Kim and Young M. Park and Kwang-Ryul Ryu},
title = {{Deriving Decision Rules to Locate Export Containers in Container Yards}},
journal = {{European Journal of Operational Research}},
volume = {124},
number = {1},
pages = {89--101},
year = {2000},
doi = {10.1016/S0377-2217(99)00116-2}
}
@article{2006-kim-hong,
author = {Kap H. Kim and Gyu-Pyo Hong},
title = {{A Heuristic Rule for Relocating Blocks}},
journal = {{Computers \& Operations Research}},
volume = {33},
number = {4},
pages = {940--954},
year = {2006},
doi = {10.1016/j.cor.2004.08.005}
}
@article{2012-caserta-etal,
author = {Marco Caserta and Silvia Schwarze and Stefan Vo\ss},
title = {{A Mathematical Formulation and Complexity Considerations for the
Blocks Relocation Problem}},
journal = {{European Journal of Operational Research}},
volume = {219},
number = {1},
pages = {96--104},
year = {2012},
doi = {10.1016/j.ejor.2011.12.039}
}
@article{2012-forster-bortfeldt,
author = {Florian Forster and Andreas Bortfeldt},
title = {{A Tree Search Procedure for the Container Relocation Problem}},
journal = {{Computers \& Operations Research}},
volume = {39},
number = {2},
pages = {299--309},
year = {2012},
doi = {10.1016/j.cor.2011.04.004}
}
@article{2013-petering-hussein,
author = {Matthew E. H. Petering and Mazen I. Hussein},
title = {{A New Mixed Integer Program and Extended Look-ahead Heuristic
Algorithm for the Block Relocation Problem}},
journal = {{European Journal of Operational Research}},
volume = {231},
number = {1},
pages = {120--130},
year = {2013},
doi = {10.1016/j.ejor.2013.05.037}
}
@article{2014-zehendner-feillet,
author = {Elisabeth Zehendner and Dominique Feillet},
title = {{A Branch and Price Approach for the Container Relocation Problem}},
journal = {{International Journal of Production Research}},
volume = {52},
number = {24},
pages = {7159--7176},
year = {2014},
doi = {10.1080/00207543.2014.965358}
}
@inbook{2014-olsen-gross,
author = {Martin Olsen and Allan Gross},
editor = {Rosa G. Gonz\'{a}lez-Ram\'{i}rez and Frederik Schulte and Stefan
Vo{\ss} and Jose A. Ceroni D\'{i}az},
title = {{Average Case Analysis of Blocks Relocation Heuristics}},
booktitle = {{Proceedings of the 5th International Conference on
Computational Logistics, ICCL'2014}},
year = {2014},
publisher = {Springer International Publishing},
pages = {81--92},
doi = {10.1007/978-3-319-11421-7_6}
}
@article{2014-lehnfeld-knust,
author = {Jana Lehnfeld and Sigrid Knust},
title = {{Loading, Unloading and Premarshalling of Stacks in Storage Areas: Survey and Classification}},
journal = {{European Journal of Operational Research}},
volume = {239},
number = {2},
pages = {297--312},
year = {2014},
doi = {10.1016/j.ejor.2014.03.011}
}
@article{2015-eskandari-azari,
author = {Hamidreza Eskandari and Esmaeel Azari},
year = {2015},
title = {{Notes on Mathematical Formulation and Complexity Considerations for
Blocks Relocation Problem}},
journal = {{Scientia Iranica. Transaction E, Industrial Engineering}},
volume = {22},
number = {6},
pages = {2722--2728}
}
@article{2016-ku-arthanari,
author = {Dusan Ku and Tiru S. Arthanari},
title = {{On the Abstraction Method for the Container Relocation Problem}},
journal = {{Computers \& Operations Research}},
volume = {68},
pages = {110--122},
year = {2016},
doi = {10.1016/j.cor.2015.11.006}
}
@article{1961-gilmore-gomory,
author = {P. C. Gilmore and R. E. Gomory},
title = {{A Linear Programming Approach to the Cutting-Stock Problem}},
journal = {{Operations Research}},
volume = {9},
number = {6},
pages = {849--859},
year = {1961},
doi = {10.1287/opre.9.6.849}
}
@article{1971-eilon-christofides,
author = {Samuel Eilon and Nicos Christofides},
title = {{The Loading Problem}},
journal = {{Management Science}},
volume = {17},
number = {5},
pages = {259--268},
year = {1971},
doi = {10.1287/mnsc.17.5.259}
}
@inproceedings{1972-garey-etal,
author = {Michael R. Garey and Ron L. Graham and Jeffrey D. Ullman},
title = {{Worst-case Analysis of Memory Allocation Algorithms}},
booktitle = {{Proceedings of the 4th Annual ACM Symposium on Theory of
Computing (STOC'1972)}},
year = {1972},
pages = {143--150},
doi = {10.1145/800152.804907},
publisher = {ACM},
address = {New York, NY, USA}
}
@book{1979-garey-johnson,
author = {Michael R. Garey and David S. Johnson},
title = {{Computers and Intractability: A Guide to the Theory of
NP-Completeness}},
year = {1979},
isbn = {0716710447},
publisher = {W. H. Freeman \& Co.},
address = {New York, NY, USA}
}
@article{2000-kenyon-remila,
author = {Claire Kenyon and Eric R\'{e}mila},
title = {{A Near-Optimal Solution to a Two-Dimensional Cutting Stock
Problem}},
journal = {{Mathematics of Operations Research}},
volume = {25},
number = {4},
year = {2000},
pages = {645--656},
doi = {10.1287/moor.25.4.645.12118},
publisher = {INFORMS},
address = {Institute for Operations Research and the Management Sciences (INFORMS), Linthicum, Maryland, USA}
}
@article{2007-iori-etal,
author = {Manuel Iori and Juan-Jos\'{e} Salazar-Gonz\'{a}lez and Daniele Vigo},
title = {{An Exact Approach for the Vehicle Routing Problem with
Two-Dimensional Loading Constraints}},
journal = {{Transportation Science}},
volume = {41},
number = {2},
pages = {253--264},
year = {2007},
doi = {10.1287/trsc.1060.0165}
}
@article{2008-gendreau-etal,
author = {Michel Gendreau and Manuel Iori and Gilbert Laporte and Silvaro Martello},
title = {{A Tabu Search Heuristic for the Vehicle Routing Problem with
Two-dimensional Loading Constraints}},
journal = {Networks},
volume = {51},
number = {1},
publisher = {Wiley Subscription Services, Inc., A Wiley Company},
doi = {10.1002/net.20192},
pages = {4--18},
year = {2008}
}
@book{2012-conway-etal,
title = {{Theory of Scheduling}},
author = {Richard W. Conway and William L. Maxwell and Louis W. Miller},
year = {2012},
publisher = {Courier Corporation}
}
This file was generated by bibtex2html 1.98.