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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.