A lasso-based LP aggregation algorithm generates sparser mixed-integer rounding cuts, reducing branch-and-bound tree size and mean runtime on challenging MIPLIB 2017 instances.
Constraint integer programming
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
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Sparsity-driven Aggregation of Mixed Integer Programs
A lasso-based LP aggregation algorithm generates sparser mixed-integer rounding cuts, reducing branch-and-bound tree size and mean runtime on challenging MIPLIB 2017 instances.