<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>5437</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>2015-09-04</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Reoptimization Techniques in MIP Solvers</title>
    <abstract language="eng">Recently, there have been many successful applications of optimization algorithms that solve a sequence of quite similar mixed-integer programs (MIPs) as subproblems. Traditionally, each problem in the sequence is solved from scratch. In this paper we consider reoptimization techniques that try to benefit from information obtained by solving previous problems of the sequence. We focus on the case that subsequent MIPs differ only in the objective function or that the feasible region is reduced. We propose extensions of the very complex branch-and-bound algorithms employed by general MIP solvers based on the idea to ``warmstart'' using the final search frontier of the preceding solver run. We extend the academic MIP solver SCIP by these techniques to obtain a reoptimizing branch-and-bound solver and report computational results which show the effectiveness of the approach.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-54375</identifier>
    <identifier type="doi">10.1007/978-3-319-20086-6_14</identifier>
    <enrichment key="SourceTitle">Lecture Notes in Computer Science</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-54375</enrichment>
    <author>Jakob Witzig</author>
    <submitter>Jakob Witzig</submitter>
    <author>Gerald Gamrath</author>
    <author>Benjamin Hiller</author>
    <series>
      <title>ZIB-Report</title>
      <number>15-24</number>
    </series>
    <collection role="ccs" number="J.">Computer Applications</collection>
    <collection role="msc" number="90-XX">OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="institutes" number="mip">Mathematical Optimization Methods</collection>
    <collection role="persons" number="gamrath">Gamrath, Gerald</collection>
    <collection role="projects" number="ASTfSCM">ASTfSCM</collection>
    <collection role="projects" number="MIP-ZIBOPT">MIP-ZIBOPT</collection>
    <collection role="projects" number="MODAL-SynLab">MODAL-SynLab</collection>
    <collection role="projects" number="Siemens">Siemens</collection>
    <collection role="projects" number="TRR154-A04">TRR154-A04</collection>
    <collection role="projects" number="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/5437/zibreport.pdf</file>
  </doc>
</export-example>
