A best-first branch-and-bound algorithm for orthogonal rectangular packing problems

DOI10.1111/J.1475-3995.1998.TB00119.XMaRDI QIDQ6850486zbMATH OpenFDO

Authors Mhand Hifi, Rachid Quafi

Publication date 2 March 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.1998.TB00119.X

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cited in

(1)

• Two-dimensional bin packing, cutting stock, and open dimension problems: a survey of practical requirements

This page was built for publication: A best-first branch-and-bound algorithm for orthogonal rectangular packing problems

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