Computational Optimization and Appli- cations 3, 111–130

Solving binary cutting stock problems by column generation, branch-and-bound · DOI 10.1007/bf01300970

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

open at publisher browse 1 citing papers

representative citing papers

Polynomial and Pseudopolynomial Algorithms for Two Classes of Bin Packing Instances

cs.DS · 2026-04-06

citing papers explorer

Showing 1 of 1 citing paper after filters.

Polynomial and Pseudopolynomial Algorithms for Two Classes of Bin Packing Instances cs.DS · 2026-04-06 · unreviewed · ref 17