Approximation algorithms for multidimensional bin packing

[1]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[2]  Leah Epstein,et al.  Multidimensional Packing Problems , 2018, Handbook of Approximation Algorithms and Metaheuristics.

[3]  J. Correa,et al.  On Guillotine Cutting Sequences , 2015, APPROX-RANDOM.

[4]  Rob van Stee,et al.  SIGACT News Online Algorithms Column 26: Bin packing in multiple dimensions , 2015, SIGA.

[5]  Rebecca Hoberg,et al.  A Logarithmic Additive Integrality Gap for Bin Packing , 2015, SODA.

[6]  Andreas Wiese,et al.  A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem , 2015, SODA.

[7]  Jirí Sgall,et al.  The optimal absolute ratio for online bin packing , 2015, SODA.

[8]  Janardhan Kulkarni,et al.  Tight Bounds for Online Vector Scheduling , 2014, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[9]  Renato Paes Leme,et al.  Role of conformity in opinion dynamics in social networks , 2014, COSN '14.

[10]  Nikhil Bansal,et al.  Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds , 2014, Algorithmica.

[11]  Klaus Jansen,et al.  A New Asymptotic Approximation Algorithm for 3-Dimensional Strip Packing , 2014, SOFSEM.

[12]  Zsolt Tuza,et al.  Tight absolute bound for First Fit Decreasing bin-packing: FFD(l) ≤ 11/9 OPT(L) + 6/9 , 2013, Theor. Comput. Sci..

[13]  Prasad Raghavendra,et al.  Approximate Constraint Satisfaction Requires Large LP Relaxations , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[14]  Adam Meyerson,et al.  Online Multidimensional Load Balancing , 2013, APPROX-RANDOM.

[15]  Thomas Rothvoß,et al.  Polynomiality for Bin Packing with a Constant Number of Item Types , 2013, SODA.

[16]  Sudebkumar Prasant Pal,et al.  Diffuse reflection diameter and radius for convex-quadrilateralizable polygons , 2013, Discret. Appl. Math..

[17]  Yossi Azar,et al.  Tight bounds for online vector bin packing , 2013, STOC '13.

[18]  Willem Jan van Hoeve,et al.  An MDD Approach to Multidimensional Bin Packing , 2013, CPAIOR.

[19]  Lars Prädel,et al.  Approximation Algorithms for Geometric Packing Problems , 2013 .

[20]  Thomas Rothvoß,et al.  Approximating Bin Packing within O(log OPT * Log Log OPT) Bins , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[21]  K. Jansen,et al.  New Approximability Results for Two-Dimensional Bin Packing , 2013, Algorithmica.

[22]  Varun Gupta,et al.  Online Stochastic Bin Packing , 2012, ArXiv.

[23]  Aleksandar Nikolov,et al.  Beck's Three Permutations Conjecture: A Counterexample and Some Consequences , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[24]  Prasad Raghavendra,et al.  On mimicking networks representing minimum terminal cuts , 2012, Inf. Process. Lett..

[25]  Sanjeev Arora,et al.  The Multiplicative Weights Update Method: a Meta-Algorithm and Applications , 2012, Theory Comput..

[26]  Shachar Lovett,et al.  Constructive Discrepancy Minimization by Walking on the Edges , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[27]  Rob van Stee,et al.  Absolute approximation ratios for packing rectangles into bins , 2012, J. Sched..

[28]  Guochuan Zhang,et al.  A new upper bound 2.5545 on 2D Online Bin Packing , 2011, TALG.

[29]  David P. Williamson,et al.  The Design of Approximation Algorithms , 2011 .

[30]  Thomas Rothvoß,et al.  The entropy rounding method in approximation algorithms , 2011, SODA.

[31]  Doron Rotem,et al.  A Linear Approximation Algorithm for 2-Dimensional Vector Packing , 2011, ArXiv.

[32]  Jan Vondrák,et al.  Multi-budgeted matchings and matroid intersection via dependent rounding , 2011, SODA '11.

[33]  Mike Stilman,et al.  Stable stacking for the distributor's pallet packing problem , 2010, 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[34]  Rakesh Bobba,et al.  Attribute-Based Messaging: Access Control and Confidentiality , 2010, TSEC.

[35]  Jakub Marecek.  Handbook of Approximation Algorithms and Metaheuristics , 2010, Comput. J..

[36]  H. Casanova,et al.  Resource allocation algorithms for virtualized service hosting platforms , 2010, J. Parallel Distributed Comput..

[37]  Friedrich Eisenbrand,et al.  Bin packing via discrepancy of permutations , 2010, SODA '11.

[38]  Hadas Shachnai,et al.  There is no EPTAS for two-dimensional knapsack , 2010, Inf. Process. Lett..

[39]  Klaus Jansen,et al.  Bin packing with fixed number of bins revisited , 2010, J. Comput. Syst. Sci..

[40]  Yong Zhou,et al.  A note on online hypercube packing , 2010, Central Eur. J. Oper. Res..

[41]  Klaus Jansen,et al.  A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability , 2009, ISAAC.

[42]  Alberto Caprara,et al.  A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing , 2009, SIAM J. Comput..

[43]  Attila Bernáth,et al.  Covering skew-supermodular functions by hypergraphs of minimum total size , 2009, Oper. Res. Lett..

[44]  Rob van Stee,et al.  Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems , 2009, APPROX-RANDOM.

[45]  Klaus Jansen,et al.  Rectangle packing with one-dimensional resource augmentation , 2009, Discret. Optim..

[46]  Klaus Jansen,et al.  Two for One: Tight Approximation of 2D Bin Packing , 2009, WADS.

[47]  B. Barak,et al.  Computational Complexity: A Modern Approach , 2009 .

[48]  Mohit Singh,et al.  Edge Coloring and Decompositions of Weighted Graphs , 2008, ESA.

[49]  Rob van Stee,et al.  Packing Rectangles into 2OPT Bins Using Rotations , 2008, SWAT.

[50]  Klaus Jansen,et al.  A Polynomial Time Approximation Scheme for the Square Packing Problem , 2008, IPCO.

[51]  Klaus Jansen,et al.  New Approximability Results for 2-Dimensional Packing Problems , 2007, MFCS.

[52]  José R. Correa,et al.  Improved Bounds on Nonblocking 3-Stage Clos Networks , 2007, SIAM J. Comput..

[53]  Nikhil Bansal,et al.  Two-dimensional bin packing with one-dimensional resource augmentation , 2007, Discret. Optim..

[54]  Leah Epstein,et al.  Bounds for online bounded space hypercube packing , 2007, Discret. Optim..

[55]  K. Jansen,et al.  Approximation Algorithms for 3D Orthogonal Knapsack , 2007, Journal of Computer Science and Technology.

[56]  Joan Boyar,et al.  The relative worst order ratio for online algorithms , 2007, TALG.

[57]  Klaus Jansen,et al.  Maximizing the Total Profit of Rectangles Packed into a Rectangle , 2007, Algorithmica.

[58]  David Pisinger,et al.  Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem , 2007, INFORMS J. Comput..

[59]  Guochuan Zhang,et al.  Harmonic algorithm for 3-dimensional strip packing problem , 2007, SODA '07.

[60]  Krzysztof Onak,et al.  Polynomial approximation schemes for smoothed and random instances of multidimensional packing problems , 2007, SODA '07.

[61]  Friedrich Eisenbrand,et al.  Carathéodory bounds for integer cones , 2006, Oper. Res. Lett..

[62]  Andreas Bortfeldt,et al.  A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces , 2006, Eur. J. Oper. Res..

[63]  Miroslav Chlebík,et al.  Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations , 2006, CIAC.

[64]  José R. Correa,et al.  Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes , 2006, Math. Oper. Res..

[65]  Klaus Jansen,et al.  On Efficient Weighted Rectangle Packing with Large Resources , 2005, ISAAC.

[66]  Andrea Lodi,et al.  A tale of two dimensional bin packing , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[67]  Leah Epstein,et al.  Online square and cube packing , 2005, Acta Informatica.

[68]  Leah Epstein,et al.  Optimal Online Algorithms for Multidimensional Packing Problems , 2005, SIAM J. Comput..

[69]  Soo Y. Chang,et al.  A two-dimensional vector packing model for the efficient use of coil cassettes , 2005, Comput. Oper. Res..

[70]  Klaus Jansen,et al.  On strip packing With rotations , 2005, STOC '05.

[71]  Gerhard J. Woeginger,et al.  The two-dimensional cutting stock problem revisited , 2005, Math. Program..

[72]  Alberto Caprara,et al.  Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing , 2005, Math. Oper. Res..

[73]  L. Epstein,et al.  This side up! , 2004, TALG.

[74]  Yoshiko Wakabayashi,et al.  Packing Problems with Orthogonal Rotations , 2004, LATIN.

[75]  Leah Epstein,et al.  Two Dimensional Packing: The Power of Rotation , 2003, MFCS.

[76]  David Pisinger,et al.  Guided Local Search for the Three-Dimensional Bin-Packing Problem , 2003, INFORMS J. Comput..

[77]  Hung Q. Ngo,et al.  Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs , 2003, SODA '03.

[78]  Klaus Jansen,et al.  An asymptotic fully polynomial time approximation scheme for bin covering , 2002, Theor. Comput. Sci..

[79]  Alberto Caprara,et al.  Packing 2-dimensional bins in harmony , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[80]  Claire Mathieu,et al.  On the Sum-of-Squares algorithm for bin packing , 2002, JACM.

[81]  Andrea Lodi,et al.  Two-dimensional packing problems: A survey , 2002, Eur. J. Oper. Res..

[82]  Rob van Stee,et al.  New bounds for multi-dimensional packing , 2002, SODA '02.

[83]  Paolo Toth,et al.  Lower bounds and algorithms for the 2-dimensional vector packing problem , 2001, Discret. Appl. Math..

[84]  Steven S. Seiden,et al.  On the online bin packing problem , 2001, JACM.

[85]  Yoshiharu Kohayakawa,et al.  Multidimensional Cube Packing , 2001, Algorithmica.

[86]  Takeshi Yoshimura,et al.  Floorplanning using a tree representation , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[87]  Claire Mathieu,et al.  A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem , 2000, Math. Oper. Res..

[88]  Yao-Wen Chang,et al.  B*-trees: a new representation for non-slicing floorplans , 2000, Proceedings 37th Design Automation Conference.

[89]  Leonid Khachiyan,et al.  Approximate Max-Min Resource Sharing for Structured Concave Optimization , 2000, SIAM J. Optim..

[90]  Daniele Vigo,et al.  The Three-Dimensional Bin Packing Problem , 2000, Oper. Res..

[91]  Steven Skiena,et al.  Who is interested in algorithms and why?: lessons from the Stony Brook algorithms repository , 1999, SIGA.

[92]  Ding-Zhu Du,et al.  On Multirate Rearrangeable Clos Networks , 1999, SIAM J. Comput..

[93]  Vangelis Th. Paschos,et al.  Differential Approximation Algorithms for Some Combinatorial Optimization Problems , 1998, Theor. Comput. Sci..

[94]  Yoji Kajitani,et al.  Module packing based on the BSG-structure and IC layout applications , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[95]  Gerhard J. Woeginger,et al.  There is no Asymptotic PTAS for Two-Dimensional Vector Packing , 1997, Inf. Process. Lett..

[96]  Gerhard J. Woeginger,et al.  Shelf Algorithms for On-Line Strip Packing , 1997, Inf. Process. Lett..

[97]  Sungsoo Park,et al.  European Journal of Operational Research a Linear Program for the Two-hub Location Problem , 2022 .

[98]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[99]  A. Steinberg,et al.  A Strip-Packing Algorithm with Absolute Performance Bound 2 , 1997, SIAM J. Comput..

[100]  Guntram Scheithauer,et al.  Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem , 1997, Oper. Res. Lett..

[101]  Yoji Kajitani,et al.  VLSI module placement based on rectangle-packing by the sequence-pair , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[102]  Arjen P. A. Vestjens,et al.  On-Line and Off-Line Approximation Algorithms for Vector Covering Problems , 1996, Algorithmica.

[103]  Claire Mathieu.  Best-Fit Bin-Packing with Random Order , 1996, SODA.

[104]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[105]  B. Kröger.  Guillotineable bin packing: A genetic approach , 1995 .

[106]  Gerhard J. Woeginger,et al.  On-line bin packing — A restricted survey , 1995, Math. Methods Oper. Res..

[107]  Bernard T. Han,et al.  Multiple-type, two-dimensional bin packing problems: Applications and algorithms , 1994, Ann. Oper. Res..

[108]  K. Dowsland.  Some experiments with simulated annealing techniques for packing problems , 1993 .

[109]  János Csirik,et al.  An on-line algorithm for multidimensional bin packing , 1993, Oper. Res. Lett..

[110]  Kam-Hoi Cheng,et al.  Heuristic Algorithms for On-Line Packing in Three Dimensions , 1992, J. Algorithms.

[111]  B. Ram.  The pallet loading problem: A survey , 1992 .

[112]  André van Vliet,et al.  An Improved Lower Bound for On-Line Bin Packing Algorithms , 1992, Inf. Process. Lett..

[113]  Paul E. Sweeney,et al.  Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography , 1992 .

[114]  Wataru Takahashi,et al.  Practical Implementation and Packaging Technologies for a Large-Scale ATM Switching System , 1991, IEEE J. Sel. Areas Commun..

[115]  Peter W. Shor,et al.  How to pack better than best fit: tight bounds for average-case online bin packing , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[116]  Éva Tardos,et al.  Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[117]  Keith W. Ross,et al.  On Nonblocking Multirate Interconnection Networks , 1991, SIAM J. Comput..

[118]  Edward G. Coffman,et al.  Probabilistic analysis of packing and partitioning algorithms , 1991, Wiley-Interscience series in discrete mathematics and optimization.

[119]  Joseph Y.-T. Leung,et al.  Packing Squares into a Square , 1990, J. Parallel Distributed Comput..

[120]  Kam-Hoi Cheng,et al.  On Three-Dimensional Packing , 1990, SIAM J. Comput..

[121]  Jonathan S. Turner,et al.  Nonblocking multirate distribution networks , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[122]  D. T. Lee,et al.  On-Line Bin Packing in Linear Time , 1989, J. Algorithms.

[123]  Alessandro Panconesi,et al.  Completeness in Approximation Classes , 1989, Inf. Comput..

[124]  Prabhakar Raghavan,et al.  Multidimensional on-line bin packing: Algorithms and worst-case analysis , 1989 .

[125]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[126]  D. T. Lee,et al.  A simple on-line bin-packing algorithm , 1985, JACM.

[127]  Monty Denneau,et al.  The GF11 supercomputer , 1985, ISCA '85.

[128]  Subhash C. Sarin,et al.  Prototype models for two-dimensional layout design of robot systems , 1984 .

[129]  Brenda S. Baker,et al.  Shelf Algorithms for Two-Dimensional Packing Problems , 1983, SIAM J. Comput..

[130]  Richard M. Karp,et al.  An efficient approximation scheme for the one-dimensional bin-packing problem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[131]  Brenda S. Baker,et al.  Lower bounds for on-line two-dimensional packing algorithms , 1982, Acta Informatica.

[132]  Ian Holyer,et al.  The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..

[133]  Edward G. Coffman,et al.  A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing , 1981 .

[134]  Robert E. Tarjan,et al.  Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms , 1980, SIAM J. Comput..

[135]  Ronald L. Rivest,et al.  Orthogonal Packings in Two Dimensions , 1980, SIAM J. Comput..

[136]  Bryan Preas,et al.  Placement Algorithms for Arbitrarily Shaped Blocks , 1979, 16th Design Automation Conference.

[137]  Andrew Chi-Chih Yao,et al.  New Algorithms for Bin Packing , 1978, JACM.

[138]  Andrew Chi-Chih Yao,et al.  Resource Constrained Scheduling as Generalized Bin Packing , 1976, J. Comb. Theory A.

[139]  David S. Johnson,et al.  Complexity Results for Multiprocessor Scheduling under Resource Constraints , 1975, SIAM J. Comput..

[140]  Jeffrey D. Ullman,et al.  Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..

[141]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[142]  Jeffrey D. Ullman,et al.  Worst-case analysis of memory allocation algorithms , 1972, STOC.

[143]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[144]  L. Moser,et al.  On packing of squares and cubes , 1968 .

[145]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[146]  C. Shannon.  A Theorem on Coloring the Lines of a Network , 1949 .

[147]  EN UrsulaVONDERLEYEN.  Concentration , 1894 .

[148]  Klaudia Frankfurter.  Computers And Intractability A Guide To The Theory Of Np Completeness , 2016 .

[149]  Leah Epstein,et al.  Harmonic Algorithm for Bin Packing. , 2015 .

[150]  Mohit Singh,et al.  On Weighted Bipartite Edge Coloring , 2015, FSTTCS.

[151]  A. López-Ortiz,et al.  Almost Online Square Packing , 2014, CCCG.

[152]  Jirí Sgall,et al.  First Fit bin packing: A tight analysis , 2013, STACS.

[153]  Daniele Vigo,et al.  Bin packing approximation algorithms: Survey and classification , 2013 .

[154]  Girum G. Demisse,et al.  Mixed Palletizing and Task Completion for Virtual Warehouses , 2012 .

[155]  Hadas Shachnai,et al.  Approximation schemes for generalized two-dimensional vector packing with application to data placement , 2012, J. Discrete Algorithms.

[156]  Rina Panigrahy,et al.  Heuristics for Vector Bin Packing , 2011 .

[157]  Klaus Jansen,et al.  A (5 / 3 + ε ) -Approximation for Strip Packing ∗ , 2011 .

[158]  Vinayaka Pandit,et al.  Discovering Bucket Orders from Data. , 2011, SDM 2011.

[159]  P. Raghavendra,et al.  Approximating np-hard problems efficient algorithms and their limits , 2009 .

[160]  M. Yagiura,et al.  Practical Algorithms for Two-Dimensional Packing , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[161]  Sheqin Dong,et al.  3D CBL: an efficient algorithm for general 3D packing problems , 2005, 48th Midwest Symposium on Circuits and Systems, 2005..

[162]  Alberto Caprara,et al.  On the two-dimensional Knapsack Problem , 2004, Oper. Res. Lett..

[163]  Hans Kellerer,et al.  An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing , 2003, Oper. Res. Lett..

[164]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[165]  Leah Epstein,et al.  On variable sized vector packing , 2003, Acta Cybern..

[166]  Monique Laurent,et al.  A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0-1 Programming , 2003, Math. Oper. Res..

[167]  Joan Boyar,et al.  The Accommodating Function: A Generalization of the Competitive Ratio , 2001, SIAM J. Comput..

[168]  E. Hopper,et al.  An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem , 2001, Eur. J. Oper. Res..

[169]  Piercar Nicola,et al.  Linear Programming and Extensions , 2000 .

[170]  Carlos Eduardo Ferreira,et al.  Packing Squares into Squares , 1999 .

[171]  E. Coffman,et al.  Bin Packing Approximation Algorithms: Combinatorial Analysis , 1999, Handbook of Combinatorial Optimization.

[172]  Gerhard J. Woeginger,et al.  On-line Packing and Covering Problems , 1996, Online Algorithms.

[173]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[174]  Frits C. R. Spieksma,et al.  A branch-and-bound algorithm for the two-dimensional vector packing problem , 1994, Comput. Oper. Res..

[175]  Gerhard J. Woeginger,et al.  A Lower Bound for On-Line Vector-Packing Algorithms , 1993, Acta Cybern..

[176]  J. Stephen Judd,et al.  The Loading Problem , 1990 .

[177]  J. B. G. Frenk,et al.  On the multidimensional vector bin packing , 1990, Acta Cybern..

[178]  A. Frieze,et al.  Approximation algorithms for the m-dimensional 0–1 knapsack problem: Worst-case and probabilistic analyses , 1984 .

[179]  David S. Johnson,et al.  Approximation Algorithms for Bin-Packing — An Updated Survey , 1984 .

[180]  David S. Johnson,et al.  Approximation Algorithms for Bin Packing Problems: A Survey , 1981 .

[181]  Wenceslas Fernandez de la Vega,et al.  Bin packing can be solved within 1+epsilon in linear time , 1981, Comb..

[182]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[183]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[184]  E. A. Dinic.  Algorithm for solution of a problem of maximal flow in a network with power estimation , 1970 .

[185]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.