<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>1759</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2013-01-04</completedDate>
    <publishedDate>2013-01-04</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Shift-And-Propagate</title>
    <abstract language="eng">For mixed integer programming, recent years have seen a growing interest in the design of general purpose primal heuristics for use inside complete solvers. Many of these heuristics rely on an optimal LP solution. Finding this may itself take a significant amount of time.&#13;
&#13;
The presented paper addresses this issue by the introduction of the Shift-And-Propagate heuristic. Shift-And-Propagate is a pre-root primal heuristic that does not require a previously found LP solution. It applies domain propagation techniques to quickly drive a variable assignment towards feasibility. Computational experiments indicate that this heuristic is a powerful supplement of existing rounding and propagation heuristics.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-17596</identifier>
    <identifier type="doi">10.1007/s10732-014-9271-0</identifier>
    <enrichment key="SourceTitle">Appeared in: Journal of Heuristics 21 (2015) pp. 73-106</enrichment>
    <author>Timo Berthold</author>
    <submitter>Timo Berthold</submitter>
    <author>Gregor Hendel</author>
    <series>
      <title>ZIB-Report</title>
      <number>13-03</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>primal heuristic</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>mixed integer programming</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>domain propagation</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>rounding</value>
    </subject>
    <collection role="msc" number="90C10">Integer programming</collection>
    <collection role="msc" number="90C11">Mixed integer programming</collection>
    <collection role="msc" number="90C59">Approximation methods and heuristics</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="institutes" number="mip">Mathematical Optimization Methods</collection>
    <collection role="persons" number="berthold">Berthold, Timo</collection>
    <collection role="persons" number="hendel">Hendel, Gregor</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="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1759/ZR-13-03.pdf</file>
  </doc>
  <doc>
    <id>1325</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2011-07-14</completedDate>
    <publishedDate>2011-07-14</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Rounding and Propagation Heuristics for Mixed Integer Programming</title>
    <abstract language="eng">Primal heuristics are an important component of state-of-the-art codes for&#13;
mixed integer programming. In this paper, we focus on primal heuristics&#13;
that only employ computationally inexpensive procedures such as rounding&#13;
and logical deductions (propagation). We give an overview of eight&#13;
different approaches. To assess the impact of these primal  heuristics on&#13;
the ability to find feasible solutions, in particular early during search,&#13;
we introduce a new performance measure, the primal integral. Computational&#13;
experiments evaluate this and other measures on MIPLIB~2010 benchmark&#13;
instances.</abstract>
    <identifier type="serial">11-29</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-13255</identifier>
    <identifier type="doi">10.1007/978-3-642-29210-1_12</identifier>
    <enrichment key="SourceTitle">Appeared in: Operations Research Proceedings 2011. Diethard Klatte et al. (eds.) Springer 2012, pp. 71-76</enrichment>
    <author>Tobias Achterberg</author>
    <submitter>Timo Berthold</submitter>
    <author>Timo Berthold</author>
    <author>Gregor Hendel</author>
    <series>
      <title>ZIB-Report</title>
      <number>11-29</number>
    </series>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>primal heuristic</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>mixed integer programming</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>domain propagation</value>
    </subject>
    <collection role="msc" number="90C11">Mixed integer programming</collection>
    <collection role="msc" number="90C59">Approximation methods and heuristics</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="institutes" number="mip">Mathematical Optimization Methods</collection>
    <collection role="persons" number="achterberg">Achterberg, Tobias</collection>
    <collection role="persons" number="berthold">Berthold, Timo</collection>
    <collection role="persons" number="hendel">Hendel, Gregor</collection>
    <collection role="projects" number="ASTfSCM">ASTfSCM</collection>
    <collection role="projects" number="MIP-ZIBOPT">MIP-ZIBOPT</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1325/ZR-11-29.pdf</file>
  </doc>
</export-example>
