Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm

DOI10.1057/PALGRAVE.JORS.2600364MaRDI QIDQ4367021zbMATH OpenOpenAlexFDO

Authors Mhand Hifi, V. Zissimopoulos

Publication date 25 November 1997

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2600364

zbMATH Keywords

bottom-up algorithmbranching strategyconstrained two-dimensional cuttinglower and upper bounds

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Recommendations

• An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
• A recursive exact algorithm for weighted two-dimensional cutting
• Exact solutions for constrained two-dimensional cutting problems
• Efficient algorithm for the constrained two-dimensional cutting stock problem

Cited in

(18)

• A recursive algorithm for constrained two-dimensional cutting problems
• New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
• Exact solutions for constrained two-dimensional cutting problems
• A recursive exact algorithm for weighted two-dimensional cutting
• An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
• The maximum diversity assortment selection problem
• Efficient algorithm for the constrained two-dimensional cutting stock problem
• Algorithms for the constrained two-staged two-dimensional cutting problem
• Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem
• A new upper bound for unconstrained two-dimensional cutting and packing
• A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
• A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
• A cooperative algorithm for constrained two-staged two-dimensional cutting problems
• An introduction to the two‐dimensional rectangular cutting and packing problem
• Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
• Exact approaches for the unconstrained two-dimensional cutting problem with defects
• EATKG: an open-source efficient \underline{E}xact \underline{A}lgorithm for the \underline{T}wo-dimensional \underline{K}napsack problem with \underline{G}uillotine constraints
• A bidirectional building approach for the 2D constrained guillotine knapsack packing problem

This page was built for publication: Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4367021)