Efficient primal heuristics for mixed-integer linear programs
This paper is a short report about our work for the primal task in the Machine Learning for Combinatorial Optimization NeurIPS 2021 Competition. For each dataset of our interest in the competition, we propose customized primal heuristic methods to efficiently identify high-quality feasible solutions...
Gespeichert in:
Hauptverfasser: | , , , , , , , , , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | This paper is a short report about our work for the primal task in the
Machine Learning for Combinatorial Optimization NeurIPS 2021 Competition. For
each dataset of our interest in the competition, we propose customized primal
heuristic methods to efficiently identify high-quality feasible solutions. The
computational studies demonstrate the superiority of our proposed approaches
over the competitors'. |
---|---|
DOI: | 10.48550/arxiv.2202.02725 |