Intelligent Systems.
Theory and Applications

(Intellektual'nye Sistemy. Teoriya i Prilozheniya)

MILP presolve using near-parallel rows

Abstract

We propose a new MILP presolve method that reduces nonzeros using near-parallel rows in the constraint matrix. A heuristic efficiently identifies promising row pairs. The method reduced nonzeros in \(30\%\) of instances in the MIPLIB 2017 Benchmark Set after HiGHS presolve.

Keywords: MILP presolve, discrete optimization.

BibTeX
@article{IS-Simakov2026,
  author  = {Simakov, Mikhail Alekseyevich},
  title   = {{MILP presolve using near-parallel rows}},
  journal = {Intelligent Systems. Theory and Applications},
  year    = {2026},
  volume  = {30},
  number  = {4},
  pages   = {188--191},
}
AMSBIB
\Bibitem{IS-Simakov2026}
\by M.\,A.~Simakov
\paper MILP presolve using near-parallel rows
\jour Intelligent Systems. Theory and Applications
\yr 2026
\vol 30
\issue 4
\pages 188--191
\lang In Russian
Published under Creative Commons Attribution 4.0 International (CC BY 4.0)

← Back to issue

× Issue cover