The Quadratic Bin Packing Problem is defined and solved via three compact MILP formulations, strengthened relaxations, a set-partitioning model, and a Branch-and-Price algorithm that outperforms compact models on large benchmark instances.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
The Quadratic Bin Packing Problem: Exact Formulations and Algorithm
The Quadratic Bin Packing Problem is defined and solved via three compact MILP formulations, strengthened relaxations, a set-partitioning model, and a Branch-and-Price algorithm that outperforms compact models on large benchmark instances.