Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem

DOI10.1016/J.EJOR.2011.11.002MaRDI QIDQ439644zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

parallel algorithmscutting problemsexact tree searchespattern dominances and symmetries

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

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

Cites work

• scientific article; zbMATH DE number 3954634 (Why is no real title available?)
• A new exact method for the two-dimensional orthogonal packing problem
• A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
• A typology of cutting and packing problems
• An Algorithm for Two-Dimensional Cutting Problems
• An approximation algorithm for solving unconstrained two-dimensional knapsack problems
• An efficient approach for large-scale two-dimensional guillotine cutting stock problems
• An exact algorithm for generating homogeneous T-shape cutting patterns
• An improved typology of cutting and packing problems
• An improved version of Wang's algorithm for two-dimensional cutting problems
• 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
• Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm
• Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
• Exact algorithms for the two-dimensional guillotine knapsack
• Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
• Lower bounds and algorithms for the 2-dimensional vector packing problem
• The Theory and Computation of Knapsack Functions
• Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
• Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems

Cited in

(6)

• The maximum diversity assortment selection problem
• An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems
• Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns
• A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
• Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
• Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization

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)