Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)

Monoidal strengthening and unique lifting in MIQCPs

  • Using the recently proposed maximal quadratic-free sets and the well-known monoidal strengthening procedure, we show how to improve inter- section cuts for quadratically-constrained optimization problems by exploiting integrality requirements. We provide an explicit construction that allows an efficient implementation of the strengthened cuts along with computational results showing their improvements over the standard intersection cuts. We also show that, in our setting, there is unique lifting which implies that our strengthening procedure is generating the best possible cut coefficients for the integer variables.
Author:Antonia ChmielaORCiD, Gonzalo Muñoz, Felipe Serrano
Document Type:In Proceedings
Parent Title (English):Integer Programming and Combinatorial Optimization. IPCO 2023.
First Page:87
Last Page:99
Series:Lecture Notes in Computer Science
Year of first publication:2023
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.