Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem
DOI10.1016/J.EJOR.2011.11.002zbMATH Open1244.90009OpenAlexW2069970312MaRDI QIDQ439644FDOQ439644
Authors: Jesica De Armas, Gara Miranda, Coromoto León 
Publication date: 16 August 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.11.002
Recommendations
- An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems
- Exact solutions for constrained two-dimensional cutting problems
- A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.
- Efficient algorithm for the constrained two-dimensional cutting stock problem
- Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm
Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Cites Work
- An improved typology of cutting and packing problems
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- A typology of cutting and packing problems
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
- An Algorithm for Two-Dimensional Cutting Problems
- Lower bounds and algorithms for the 2-dimensional vector packing problem
- A new exact method for the two-dimensional orthogonal packing problem
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
- The Theory and Computation of Knapsack Functions
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems
- An exact algorithm for generating homogeneous T-shape cutting patterns
- Exact algorithms for the two-dimensional guillotine knapsack
- An improved version of Wang's algorithm for two-dimensional cutting problems
- Title not available (Why is that?)
- Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm
Cited In (6)
- An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
- The maximum diversity assortment selection problem
- Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns
This page was built for publication: Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439644)
