Padberg, Manfred - In: Mathematical Methods of Operations Research 52 (2000) 1, pp. 1-21
The three-dimensional orthogonal packing problem consists of filling a big rectangular box with as many small rectangular boxes as possible. In a recent paper G. Fasano (Alenia Aerospazio, Turin) has given a mixed-integer programming formulation of this problem. Here we extend Fasano's...
