A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem

DOI10.1080/03155986.1994.11732257MaRDI QIDQ4834079zbMATH OpenOpenAlexFDO

Authors Alexander G. Tarnowski, Guntram Scheithauer, 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

pallet loadingpolynomial time algorithmtwo-dimensional guillotine cutting stock

Mathematics Subject Classification ID

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

Recommendations

• Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds
• scientific article; zbMATH DE number 1264416
• A fast algorithm for two-dimensional pallet loading problems of large size
• A polynomial algorithm for one problem of guillotine cutting
• An algorithm for the 2D guillotine cutting stock problem

Cited in

(18)

• An efficient approach for the multi-pallet loading problem
• Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles
• A branch-and-cut algorithm for the pallet loading problem
• A polynomial time algorithm for unloading boxes off a gravity conveyor
• Solving the pallet loading 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
• Dynamic programming algorithms for the optimal cutting of equal rectangles
• Dynamic programming algorithms for generating optimal strip layouts
• Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem
• A simple algorithm for generating optimal equal circle cutting patterns with minimum sections
• The pallet loading problem: a review of solution methods and computational experiments
• scientific article; zbMATH DE number 1264416 (Why is no real title available?)
• The G4-Heuristic for the Pallet Loading Problem
• 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

This page was built for publication: A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4834079)