Name
Abstract | ||
|---|---|---|
Motivated by the perspective use in decomposition-based generic Mixed Integer Programming (MIP) solvers, we consider the problem of scoring Dantzig-Wolfe decomposition patterns. In particular, assuming to receive in input a MIP instance, we tackle the issue of estimating the tightness of the dual bound yielded by a particular decomposition of that MIP instance, and the computing time required to obtain such a dual bound, looking only at static features of the corresponding data matrices. We propose decomposition ranking methods. We also sketch and evaluate an architecture for an automatic data-driven detector of good decompositions. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.endm.2018.07.032 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
Dantzig-Wolfe decomposition,general purpose solvers,machine learning | Discrete mathematics,Ranking,Matrix (mathematics),Theoretical computer science,Integer programming,Detector,Mathematics,Decomposition,Sketch | Journal |
Volume | ISSN | Citations |
69 | 1571-0653 | 0 |
PageRank | References | Authors |
0.34 | 2 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Saverio Basso | 1 | 0 | 0.34 |
| Alberto Ceselli | 2 | 341 | 30.53 |