Recent advances on two-dimensional bin packing problems
From MaRDI portal
Publication:697576
DOI10.1016/S0166-218X(01)00347-XzbMATH Open1022.90020MaRDI QIDQ697576FDOQ697576
Recommendations
- Two-dimensional bin packing problems
- Two-dimensional packing problems: a survey
- A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
- Two-Dimensional Finite Bin-Packing Algorithms
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
Cites Work
- scientific article; zbMATH DE number 1187157 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 176070 (Why is no real title available?)
- scientific article; zbMATH DE number 1016966 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1488076 (Why is no real title available?)
- A 2.5 times optimal algorithm for packing in two dimensions
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A Linear Programming Approach to the Cutting-Stock Problem
- A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- A algorithm for two-dimensional packing
- A lower bound for the non-oriented two-dimensional bin packing problem
- A near-optimal solution to a two-dimensional cutting stock problem
- An Algorithm for Two-Dimensional Cutting Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- An improved BL lower bound
- Approximation algorithm for the oriented two-dimensional bin packing problem
- Exact solution of the two-dimensional finite bin packing problem
- Heuristic algorithms for the three-dimensional bin packing problem
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- Multistage Cutting Stock Problems of Two and More Dimensions
- On Packing Two-Dimensional Bins
- Online algorithms. The state of the art
- Optimal Scheduling of Tasks on Identical Parallel Processors
- Orthogonal Packings in Two Dimensions
- Packings in two dimensions: Asymptotic average-case analysis of algorithms
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms
- Shelf Algorithms for Two-Dimensional Packing Problems
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- Two-Dimensional Finite Bin-Packing Algorithms
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Cited In (69)
- Packaging optimization using the dynamic vector fields method
- Prospective network flow models and algorithms for bin packing problems
- Optimisation hybride par colonies de fourmis pour le problème de découpe à deux dimensions
- Models for two-dimensional bin packing problems with customer order spread
- A mathematical modeling approach to optimize composite parts placement in autoclave
- Title not available (Why is no real title available?)
- Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts
- Title not available (Why is no real title available?)
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- Hybrid approach for the two-dimensional bin packing problem with two-staged patterns
- Analysis of distributed genetic algorithms for solving cutting problems
- The two dimensional bin packing problem with side constraints
- Local search of orthogonal packings using the lower bounds
- Exact solution techniques for two-dimensional cutting and packing
- Number of bins and maximum lateness minimization in two-dimensional bin packing
- Heuristics with stochastic neighborhood structures for two-dimensional bin packing and cutting stock problems
- An introduction to the two‐dimensional rectangular cutting and packing problem
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- Optimal aircraft load balancing
- A hierarchical approach for solving an integrated packing and sequence-optimization problem in production of glued laminated timber
- Layout optimisation for an installation port of an offshore wind farm
- 2DPackLib: a two-dimensional cutting and packing library
- A computational study of lower bounds for the two dimensional bin packing problem
- Chips on wafers, or packing rectangles into grids
- Improved filtering for the bin-packing with cardinality constraint
- A sequential value correction heuristic for a bi-objective two-dimensional bin-packing
- Title not available (Why is no real title available?)
- A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates
- A hybrid heuristic algorithm for the 2D variable-sized bin packing problem
- Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
- Constrained order packing: comparison of heuristic approaches for a new bin packing problem
- A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints
- A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
- A single machine scheduling problem with two-dimensional vector packing constraints
- Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand
- Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers
- An agent-based approach to the two-dimensional guillotine bin packing problem
- A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS
- Models and algorithms for fair layout optimization problems
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- The off-line group seat reservation problem
- Optimization of inland shipping. A polynomial time algorithm for the single-ship single-lock optimization problem
- Packing, covering and tiling in two-dimensional spaces
- A branch-and-price algorithm for the two-dimensional level strip packing problem
- An improved typology of cutting and packing problems
- Two- and three-dimensional parametric packing
- A 3-approximation algorithm for two-dimensional bin packing
- Two-dimensional packing problems: a survey
- A virtual microstructure generator for 3D stone masonry walls
- Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search
- A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
- An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery
- An efficient deterministic optimization approach for rectangular packing problems
- Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem
- Two-dimensional bin packing problems
- New Approximability Results for 2-Dimensional Packing Problems
- The two-dimensional bin packing problem with variable bin sizes and costs
- A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem
- Rectangle transformation problem
- New resolution algorithm and pretreatments for the two-dimensional bin-packing problem
- Deterministic model for customized pilot manufacture production with various backplane sizes
- A new exact method for the two-dimensional orthogonal packing problem
- A branch-and-price algorithm for the temporal bin packing problem
- A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem
- Exact and heuristic methods for placing ships in locks
- Sequential heuristic for the two-dimensional bin-packing problem
Uses Software
This page was built for publication: Recent advances on two-dimensional bin packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q697576)
