Approximation algorithm for the oriented two-dimensional bin packing problem
From MaRDI portal
Publication:1806892
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
Cites work
- scientific article; zbMATH DE number 1175962 (Why is no real title available?)
- A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem
- A typology of cutting and packing problems
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Exact solution of the two-dimensional finite bin packing problem
- Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem
- On Packing Two-Dimensional Bins
- Packing problems
- Two-Dimensional Finite Bin-Packing Algorithms
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Cited in
(29)- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
- Packing, covering and tiling in two-dimensional spaces
- A hybrid genetic algorithm for the two-dimensional single large object placement problem
- An exact algorithm for the dual bin packing problem
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- Metaheuristics for truck loading in the car production industry
- An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
- An investigation into two bin packing problems with ordering and orientation implications
- An efficient, effective, and robust decoding heuristic for metaheuristics-based layout optimization
- A fast algorithm for two-dimensional pallet loading problems of large size
- An improved typology of cutting and packing problems
- Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning
- 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
- 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
- Two-dimensional packing problems: a survey
- A lower bound for the non-oriented two-dimensional bin packing problem
- A 3-approximation algorithm for two-dimensional bin packing
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- An agent-based approach to the two-dimensional guillotine bin packing problem
- Recent advances on two-dimensional bin packing problems
- An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
- Exact and approximate methods for the score-constrained packing problem
- An introduction to the two‐dimensional rectangular cutting and packing problem
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
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)
