Lower bounds and algorithms for the 2-dimensional vector packing problem

Discrete Applied Mathematics

Volumn 111, Issue 3, 2001, Pages 231-262

  Caprara, Alberto ^a   Toth, Paolo ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Branch and bound; Branch and price; Heuristics; Lower bounds; Two dimensional vector packing problem

Indexed keywords

EID: 0035427019     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00267-5     Document Type: Article

References (31)

1. Barnhart C., Johnson E.L., Nemhauser G.L., Savelsbergh M.W.P., Vance P.H. Branch-and-price: column generation for solving huge integer programs. Oper. Res. 46:1998;316-329.
2. Caprara A. Properties of some ILP formulations of a class of partitioning problems. Discrete Appl. Math. 87:1998;11-23.
3. Chan L.M.A., Simchi-Levi D., Bramel J. Worst-case analyses, linear programming and the bin packing problem. Math. Programming. 83:1998;213-227.
4. C. Chekuri, S. Khanna, On multi-dimensional packing problems, Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'99), ACM Press, New York, 1999.
5. Chen B., Srivastava B. An improved lower bound for the bin packing problem. Discrete Appl. Math. 66:1996;81-94.
6. E.G. Coffman Jr., M.R. Garey, D.S. Johnson, Approximation algorithms for bin-packing - an updated survey, in: D.S. Hochbaum (Ed.), Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, Boston, 1997.
7. Cormen T.H., Leiserson C.E., Rivest R.R. Introduction to Algorithms. 1990;MIT Press, Cambridge, MA.
8. Derigs U. Solving non-bipartite matching problems via shortest path techniques. Ann. Oper. Res. 13:1988;225-261.
9. Eilon S., Christofides N. The loading problem. Management Sci. 17:1971;259-267.
10. Falkenauer E. A hybrid grouping genetic algorithm for bin packing. J. Heuristics. 2:1996;5-30.
11. Fernandez de la Vega W., Lueker G.S. Bin-packing can be solved within. 1+ε in linear time Combinatorica. 1:1981;349-355.
12. Garey M.R., Graham R.L., Johnson D.S., Yao A.C. Resource constrained scheduling as generalized bin packing. J. Combin. Theory (A). 21:1976;257-298.
13. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, New York.
14. A.M.H. Gerards, Matching, in: M.O. Ball, T.L. Magnanti, C.L. Monma, G.L. Nemhauser (Eds.), Handbook in Operations Research and Management Sciences, Vol.: Networks, North-Holland, Amsterdam, 1995.
15. Gilmore P.C., Gomory R.E. A linear programming approach to the cutting stock problem. Oper. Res. 9:1961;849-859.
16. Gilmore P.C., Gomory R.E. A linear programming approach to the cutting stock problem: Part II. Oper. Res. 11:1963;863-888.
17. Grötschel M., Lovász L., Schrijver A. The ellipsoid algorithm and its consequences in combinatorial optimization. Combinatorica. 1:1981;169-197.
18. Hammer P.L., Mahadev N.V.R. Bithreshold graphs. SIAM J. Algebraic Discrete Methods. 6:1985;497-506.
19. Han B.T., Diehr G., Cook J.S. Multiple-type, two-dimensional bin packing problems: applications and algorithms. Ann. Oper. Res. 50:1994;239-261.
20. Hung M.S., Brown J.R. An algorithm for a class of loading problems. Naval Res. Logistics Quart. 25:1978;289-297.
21. Martello S., Toth P. Lower bounds and reduction procedures for the bin packing problem. Discrete Appl. Math. 28:1990;59-70.
22. Martello S., Toth P. Knapsack Problems: Algorithms and Computer Implementations. 1990;Wiley, New York.
23. S. Martello, P. Toth, Upper bounds and algorithms for the two-constraint knapsack problem, Working paper, University of Bologna, 1996.
24. Maruyama K., Chang S.K., Tang D.T. A general packing algorithm for multidimensional resource requirements. Internat. J. Comput. Inform. Sci. 6:1977;131-149.
25. Spieksma F.C.R. A branch-and-bound algorithm for the two-dimensional vector packing problem. Comput. oper. Res. 21:1994;19-25.
26. J.M. Valerio de Carvalho, Exact solution of cutting stock problems using column generation and branch-and-bound, International Transactions in Operational Research 5 (1998) 35-44.
27. P.H. Vance, Branch-and-price algorithms for the one-dimensional cutting stock problem, Comput. Optim. Appl. 9 (1998) 211-228.
28. Vance P.H., Barnhart C., Johnson E.L., Nemhauser G.L. Solving binary cutting stock problems by column generation and branch-and-bound. Comput. Optim. Appl. 3:1994;111-130.
29. F. Vanderbeck, Computational study of a column generation algorithm for bin packing and cutting stock problems, Math. Programming 86 (1999) 565-594.
30. Woeginger G.J. There is no asymptotic PTAS for two-dimensional vector packing. Inform. Process. Lett. 64:1997;293-297.
31. Yao A.C. New algorithms for bin packing. J. ACM. 27:1980;207-227.