Cutting and packing optimization. Problems modeling and solution methods. (Q931915): Difference between revisions

This interesting textbook covers main problems in allocation, packing and cutting problems. Especially the cutting stock and bin packing, the Guillotine cutting, the non-Guillotine packing of rectangles, strip packing, pallet and container loading problems are investigated. All problems are modeled using mixed discrete linear programming and both exact and approximation algorithms for their solution are proposed. The theoretical material is complemented with a large number of exercises and hints for their solution, as well as with many examples and illustrations. The interested reader can find material related to the (modified) integer round-up property, upper and lower bounds for the optimal objective function value for different problems, bounds for the worst and average case behavior of approximate algorithms, algorithms for off- and on-line problems as well as approaches for problems with additional quality restrictions. The textbook can be highly recommended both to students of (business) mathematics and economy and practitioners interested in solving packing or cutting problems.