An automated framework certifies pairwise idealness of rectangle-packing MILP formulations up to numeric tolerances, disproving one existing formulation and introducing a new multilinear one.
Verifying integer programming results
1 Pith paper cite this work, alongside 31 external citations. Polarity classification is still indexing.
1
Pith paper citing it
31
external citations · OpenAlex
fields
math.OC 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing
An automated framework certifies pairwise idealness of rectangle-packing MILP formulations up to numeric tolerances, disproving one existing formulation and introducing a new multilinear one.