Exact IP formulations and a Benders algorithm solve the generalized multiple strip packing problem under heterogeneous per-unit-area costs for the first time.
A fast 5/2-approximation algorithm for hierarchical scheduling
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Exact Methods for the Generalized Multiple Strip Packing Problem with Heterogeneous Costs
Exact IP formulations and a Benders algorithm solve the generalized multiple strip packing problem under heterogeneous per-unit-area costs for the first time.