Approximation algorithm for the oriented two-dimensional bin packing problem

DOI10.1016/S0377-2217(97)00388-3zbMATH Open0937.90121MaRDI QIDQ1806892FDOQ1806892

Andrea Lodi, Silvano Martello, Daniele Vigo

Publication date: 14 June 2000

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

Recommendations

• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• A 3-approximation algorithm for two-dimensional bin packing
• A lower bound for the non-oriented two-dimensional bin packing problem
• Improved approximation algorithm for two-dimensional bin packing
• The two-dimensional cutting stock problem revisited

zbMATH Keywords

heuristicpackingtabu searchcutting

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• On Packing Two-Dimensional Bins
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• A typology of cutting and packing problems
• Exact solution of the two-dimensional finite bin packing problem
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• Two-Dimensional Finite Bin-Packing Algorithms
• An Algorithm for Two-Dimensional Cutting Problems
• Packing problems
• Title not available (Why is that?)
• A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem
• Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem

Cited In (28)

• Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
• TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
• An introduction to the two‐dimensional rectangular cutting and packing problem
• An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
• Layout optimisation for an installation port of an offshore wind farm
• An efficient, effective, and robust decoding heuristic for metaheuristics-based layout optimization
• A beam search approach to solve the convex irregular bin packing problem with guillotine guts
• 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
• A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
• Metaheuristics for truck loading in the car production industry
• Recent advances on two-dimensional bin packing problems
• A fast algorithm for two-dimensional pallet loading problems of large size
• 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
• Packing, covering and tiling in two-dimensional spaces
• An improved typology of cutting and packing problems
• A 3-approximation algorithm for two-dimensional bin packing
• Two-dimensional packing problems: a survey
• A lower bound for the non-oriented two-dimensional bin packing problem
• An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
• Exact and approximate methods for the score-constrained packing problem
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
• An exact algorithm for the dual bin packing problem
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin 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

This page was built for publication: Approximation algorithm for the oriented two-dimensional bin packing problem

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