A combined variable aggregation presolving technique for mixed integer programming
Presolving is a critical component in modern mixed integer programming (MIP ) solvers. In this paper, we propose a new and effective presolving method named inequation-based variable aggregation and develop a combined variable aggregation (VA ) technique with the advantage of significantly reducing...
Uložené v:
| Vydané v: | Operations research letters Ročník 53; s. 107074 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier B.V
01.03.2024
|
| Predmet: | |
| ISSN: | 0167-6377, 1872-7468 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | Presolving is a critical component in modern mixed integer programming (MIP ) solvers. In this paper, we propose a new and effective presolving method named inequation-based variable aggregation and develop a combined variable aggregation (VA ) technique with the advantage of significantly reducing the scales of MIP problems. This technique is particularly effective for problems involving semi-continuous variables, such as unit commitment problems. Extensive numerical experiments demonstrate that the combined VA technique can substantially accelerate the solution process of MIP problems. |
|---|---|
| ISSN: | 0167-6377 1872-7468 |
| DOI: | 10.1016/j.orl.2024.107074 |