On d‐threshold graphs and d‐dimensional bin packing

[1]  S. Martello,et al.  Exact Solution of the Two-Dimensional Finite Bon Packing Problem , 1998 .

[2]  Silvio Micali,et al.  An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

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

[4]  William J. Cook,et al.  Computing Minimum-Weight Perfect Matchings , 1999, INFORMS J. Comput..

[5]  D. S. Johnson,et al.  On Packing Two-Dimensional Bins , 1982 .

[6]  R. Gomory,et al.  Multistage Cutting Stock Problems of Two and More Dimensions , 1965 .

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

[8]  P. Hammer,et al.  Aggregation of inequalities in integer programming. , 1975 .

[9]  J. O. Berkey,et al.  Two-Dimensional Finite Bin-Packing Algorithms , 1987 .

[10]  Dominique de Werra,et al.  Four classes of perfectly orderable graphs , 1987, J. Graph Theory.

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  Marco A. Boschetti,et al.  The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case , 2003, 4OR.

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

[14]  Marco A. Boschetti,et al.  The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds , 2003, 4OR.

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

[16]  Sándor P. Fekete,et al.  New classes of fast lower bounds for bin packing problems , 2001, Math. Program..