Lower Bounds and Algorithms for the 2-Dimensional Vector Packing

@inproceedings{Caprara2001LowerBA,
  title={Lower Bounds and Algorithms for the 2-Dimensional Vector Packing},
  author={P. Caprara and Paolo Toth},
  year={2001}
}
Given n items, each having, say, a weight and a length, and n identical bins with a weight and a length capacity, the 2-Dimensional Vector Packing Problem (2-DVPP) calls for packing all the items into the minimum number of bins. The problem is NP-hard, and has applications in loading, scheduling and layout design. As for the closely-related Bin Packing Problem (BPP), there are two main possible approaches for the exact solution of 2-DVPP. The rst approach is based on lower bounds and heuristics… CONTINUE READING