<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>7999</id>
    <completedYear/>
    <publishedYear>2021</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">On the implementation and strengthening of intersection cuts for QCQPs</title>
    <abstract language="eng">The generation of strong linear inequalities for QCQPs has been recently tackled by a number of authors using the intersection cut paradigm - a highly studied tool in integer programming whose flexibility has triggered these renewed efforts in non-linear settings. In this work, we consider intersection cuts using the recently proposed construction of maximal quadratic-free sets. Using these sets, we derive closed-form formulas to compute intersection cuts which allow for quick cut-computations by simply plugging-in parameters associated to an arbitrary quadratic inequality being violated by a vertex of an LP relaxation. Additionally, we implement a cut-strengthening procedure that dates back to Glover and evaluate these techniques with extensive computational experiments.</abstract>
    <identifier type="urn">urn:nbn:de:0297-zib-79994</identifier>
    <identifier type="doi">10.1007/978-3-030-73879-2_10</identifier>
    <enrichment key="PeerReviewed">no</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <enrichment key="SourceTitle">Integer Programming and Combinatorial Optimization: 22nd International Conference, IPCO 2021, pp. 134-147, Vol.22, 2021</enrichment>
    <author>Antonia Chmiela</author>
    <submitter>Antonia Chmiela</submitter>
    <author>Gonzalo Muñoz</author>
    <author>Felipe Serrano</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Intersection cuts</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>QCQPs</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Quadratic-free sets</value>
    </subject>
    <collection role="msc" number="90C20">Quadratic programming</collection>
    <collection role="msc" number="90C26">Nonconvex programming, global optimization</collection>
    <collection role="msc" number="90C30">Nonlinear programming</collection>
    <collection role="projects" number="MODAL-SynLab">MODAL-SynLab</collection>
    <collection role="projects" number="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="projects" number="EnBA-M">EnBA-M</collection>
    <collection role="institutes" number="ais2t">AI in Society, Science, and Technology</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/7999/ZIBReport_20-29.pdf</file>
  </doc>
</export-example>
