Approximation algorithm for the oriented two-dimensional bin packing problem
From MaRDI portal
Publication:1806892
DOI10.1016/S0377-2217(97)00388-3zbMath0937.90121MaRDI QIDQ1806892
Andrea Lodi, Daniele Vigo, Silvano Martello
Publication date: 14 June 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (23)
A heuristic for solving large bin packing problems in two and three dimensions ⋮ Constrained order packing: comparison of heuristic approaches for a new bin packing problem ⋮ A hybrid algorithm for constrained order packing ⋮ TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem ⋮ An improved typology of cutting and packing problems ⋮ A hybrid genetic algorithm for the two-dimensional single large object placement problem ⋮ Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning ⋮ A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing ⋮ Exact and approximate methods for the score-constrained packing problem ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem ⋮ Metaheuristics for truck loading in the car production industry ⋮ Packing, covering and tiling in two-dimensional spaces ⋮ Layout optimisation for an installation port of an offshore wind farm ⋮ A beam search approach to solve the convex irregular bin packing problem with guillotine guts ⋮ Recent advances on two-dimensional bin packing problems ⋮ A fast algorithm for two-dimensional pallet loading problems of large size ⋮ An efficient, effective, and robust decoding heuristic for metaheuristics-based layout optimization ⋮ An agent-based approach to the two-dimensional guillotine bin packing problem ⋮ New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems ⋮ Two-dimensional packing problems: a survey ⋮ Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
Cites Work
- Unnamed Item
- Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem
- Packing problems
- A typology of cutting and packing problems
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Two-Dimensional Finite Bin-Packing Algorithms
- On Packing Two-Dimensional Bins
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- An Algorithm for Two-Dimensional Cutting Problems
- A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem
This page was built for publication: Approximation algorithm for the oriented two-dimensional bin packing problem
