A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem

DOI10.1080/03155986.1994.11732257zbMath0824.90117OpenAlexW2400899291MaRDI QIDQ4834079

Guntram Scheithauer, Alexander G. Tarnowski, Johannes Terno

Publication date: 9 November 1995

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03155986.1994.11732257

zbMATH Keywords

polynomial time algorithmpallet loadingtwo-dimensional guillotine cutting stock

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items

Solving the pallet loading problem, A simple algorithm for generating optimal equal circle cutting patterns with minimum sections, Simplest optimal cutting patterns for equal rectangles, Simplest optimal guillotine cutting patterns for strips of identical circles, T-shape homogeneous block patterns for the two-dimensional cutting problem, Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds, A polynomial algorithm for one problem of guillotine cutting, Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization, A branch-and-cut algorithm for the pallet loading problem, Dynamic programming algorithms for the optimal cutting of equal rectangles, Dynamic programming algorithms for generating optimal strip layouts, The pallet loading problem: a review of solution methods and computational experiments, An efficient approach for the multi-pallet loading problem, Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles, Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem