A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
From MaRDI portal
Publication:632697
DOI10.1016/J.COR.2010.12.013zbMATH Open1208.90143OpenAlexW1993399041MaRDI QIDQ632697FDOQ632697
Authors: Christoforos Charalambous, Krzysztof Fleszar 
Publication date: 25 March 2011
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.12.013
Recommendations
- Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
- Solving two-dimensional bin packing problems with two-stage guillotine cutting by combined local search heuristics
- Sequential heuristic for the two-dimensional bin-packing problem
- Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- An improved typology of cutting and packing problems
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- Two-dimensional packing problems: a survey
- An agent-based approach to the two-dimensional guillotine bin packing problem
- A typology of cutting and packing problems
- Exact solution of the two-dimensional finite bin packing problem
- Two-Dimensional Finite Bin-Packing Algorithms
- Recent advances on two-dimensional bin packing problems
- A lower bound for the non-oriented two-dimensional bin packing problem
- A new lower bound for the non-oriented two-dimensional bin-packing problem
- Models and algorithms for three-stage two-dimensional bin packing
Cited In (28)
- Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
- Heuristics with stochastic neighborhood structures for two-dimensional bin packing and cutting stock problems
- Solving two-dimensional bin packing problems with two-stage guillotine cutting by combined local search heuristics
- A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- Heuristic search algorithm for the rectangular fixed-size guillotine bin packing problem
- 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
- 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
- A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints
- Recent advances on two-dimensional bin packing problems
- 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
- A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
- Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem
- Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints
- Heuristics for packing semifluids
- Multi-dimensional bin packing problems with guillotine constraints
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem
- Hybrid approach for the two-dimensional bin packing problem with two-staged patterns
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- New resolution algorithm and pretreatments for the two-dimensional bin-packing problem
- Heuristic placement routines for two-dimensional bin packing problem
- An exact algorithm for the two-dimensional stage-unrestricted guillotine cutting/packing decision problem
- Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
- Sequential heuristic for the two-dimensional bin-packing problem
This page was built for publication: A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632697)
