Lower bounds and algorithms for the 2-dimensional vector packing problem-Reference-Cited by-同舟云学术

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

Published:2001-08 Issue:3 Volume:111 Page:231-262
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Caprara Alberto,Toth Paolo

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference31 articles.

1. Branch-and-price: column generation for solving huge integer programs;Barnhart;Oper. Res.,1998

2. Properties of some ILP formulations of a class of partitioning problems;Caprara;Discrete Appl. Math.,1998

3. Worst-case analyses, linear programming and the bin packing problem;Chan;Math. Programming,1998

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. An improved lower bound for the bin packing problem;Chen;Discrete Appl. Math.,1996

Cited by 71 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Reinforcement learning for freight booking control problems;Journal of Revenue and Pricing Management;2024-03-16

2. Local-Search and Price-and-Branch Heuristics for Vector Bin Packing;2024

3. Minimizing the Non-value Task Times: A Pickup and Delivery Problem with Two-Dimensional Bin-Packing;Operations Research and Enterprise Systems;2023-12-15

4. Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows;Computers & Operations Research;2023-09

5. A tailored adaptive large neighborhood search algorithm for the air cargo partitioning problem with a piecewise linear cost function;Soft Computing;2023-08-03