The G4-Heuristic for the Pallet Loading Problem
From MaRDI portal
Publication:4717141
DOI10.1057/jors.1996.57zbMath0864.90108OpenAlexW2005177364MaRDI QIDQ4717141
Guntram Scheithauer, Johannes Terno
Publication date: 22 June 1997
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1996.57
Related Items
Logistic constraints in container loading problems: the impact of complete shipment conditions, A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem, Solving the pallet loading problem, An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems, The minimum size instance of a Pallet Loading Problem equivalence class, Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem, An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts, Matheuristics: survey and synthesis, An introduction to the two‐dimensional rectangular cutting and packing problem, Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization, Exact approaches for the unconstrained two-dimensional cutting problem with defects, The static stability of support factor‐based rectangular packings: an assessment by regression analysis, The container loading problem with cargo stability: a study on support factors, mechanical equilibrium and grids, The cutting stock problem in a hardboard industry: A case study., The multiple container loading cost minimization problem, Layer-layout-based heuristics for loading homogeneous items into a single container, The Meet-in-the-Middle Principle for Cutting and Packing Problems, Improved state space relaxation for constrained two-dimensional guillotine cutting problems, Analysis of upper bounds for the pallet loading problem, A fast algorithm for two-dimensional pallet loading problems of large size, Um método heurístico baseado em relaxação Lagrangiana para o problema de carregamento de paletes do produtor, A branch-and-cut algorithm for the pallet loading problem, Grids for cutting and packing problems: a study in the 2D knapsack problem, Practical constraints in the container loading problem: comprehensive formulations and exact algorithm, Computing stable loads for pallets, The pallet loading problem: a review of solution methods and computational experiments, The exact solutions of several types of container loading problems, The pinwheel pattern and its application to the manufacturer's pallet-loading problem, 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, 4-block heuristic for the rectangle packing problem, Improved flow-based formulations for the skiving stock problem, An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container, Enhanced formulation for the Guillotine 2D Cutting knapsack problem, On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
