Constrained two-dimensional cutting stock problems a best-first branch-and-bound algorithm

DOI10.1111/J.1475-3995.2000.TB00194.XMaRDI QIDQ6852448zbMATH OpenFDO

Authors Van-Dat Cung, Mhand Hifi, Bertrand LeCun

Publication date 25 February 2026

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/J.1475-3995.2000.TB00194.X

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Cited in

(1)

• 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

This page was built for publication: Constrained two-dimensional cutting stock problems a best-first branch-and-bound algorithm

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