Parametric on-line algorithms for packing rectangles and boxes.

DOI10.1016/S0377-2217(02)00539-8zbMath1137.90740OpenAlexW2049385491MaRDI QIDQ1405228

Flávio K. Miyazawa, Yoshiko Wakabayashi

Publication date: 25 August 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00539-8

zbMATH Keywords

PackingApproximation algorithmsOn-line packingParametric packingThree-dimensional packing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

Two- and three-dimensional parametric packing ⋮ The class constrained bin packing problem with applications to video-on-demand ⋮ Three-dimensional packings with rotations

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm for the three-dimensional packing problem with asymptotic performance analysis
• An on-line algorithm for multidimensional bin packing
• Multidimensional on-line bin packing: Algorithms and worst-case analysis
• Fast algorithms for bin packing
• The Parametric Behavior of the First-Fit Decreasing Bin Packing Algorithm
• On Three-Dimensional Packing
• Parametric Lower Bound for On-Line Bin-Packing
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• A algorithm for two-dimensional packing
• On Packing Two-Dimensional Bins
• Heuristic algorithms for on-line packing in three dimensions
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem

This page was built for publication: Parametric on-line algorithms for packing rectangles and boxes.