Hybrid approach for the two-dimensional bin packing problem with two-staged patterns
From MaRDI portal
Publication:2811942
DOI10.1111/itor.12188zbMath1342.90158OpenAlexW2119569836MaRDI QIDQ2811942
Yi-Ping Cui, Yaodong Cui, Yi Yao
Publication date: 9 June 2016
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12188
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (1)
Cites Work
- Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
- A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
- Recent advances on two-dimensional bin packing problems
- An agent-based approach to the two-dimensional guillotine bin packing problem
- Two-dimensional packing problems: a survey
- Models and bounds for two-dimensional level packing problems
- Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns
- Sequential heuristic for the two-dimensional bin-packing problem
- An improved typology of cutting and packing problems
- Models and algorithms for three-stage two-dimensional bin packing
- A Set-Covering-Based Heuristic Approach for Bin-Packing Problems
- Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
- HEURISTICS WITH STOCHASTIC NEIGHBORHOOD STRUCTURES FOR TWO-DIMENSIONAL BIN PACKING AND CUTTING STOCK PROBLEMS
- Two-Dimensional Finite Bin-Packing Algorithms
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
This page was built for publication: Hybrid approach for the two-dimensional bin packing problem with two-staged patterns
