An exact depth-first algorithm for the pallet loading problem
type: Item
instance of: scholarly article
title: An exact depth-first algorithm for the pallet loading problem
zbMATH Open document ID: 0946.90057
DOI: 10.1016/S0377-2217(97)00272-5
author: Subir Bhattacharya
author: Sumita Bhattacharya
author: Rahul Roy
published in: European Journal of Operational Research
publication date: 1999-09-16T00:00:00Z
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 1337805
zbMATH Keywords: packing problems
zbMATH Keywords: depth-first search
zbMATH Keywords: optimization
zbMATH Keywords: pruning
MaRDI profile type: Publication
cites work: A typology of cutting and packing problems
cites work: An exact algorithm for the pallet loading problem
cites work: The Three-Dimensional Pallet Chart: An Analysis of the Factors Affecting the Set of Feasible Layouts for a Class of Two-Dimensional Packing Problems
cites work: An Improved Algorithm for the Non-Guillotine-Constrained Cutting-Stock Problem
cites work: How to use structural constraints to compute an upper bound for the pallet loading problem
cites work: An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
cites work: Packing problems
cites work: A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
cites work: Loading Multiple Pallets
description: scientific article; zbMATH DE number 1337805