<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>1462</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2012-01-27</completedDate>
    <publishedDate>2012-01-27</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Steiner Tree Packing Revisited</title>
    <abstract language="eng">The Steiner tree packing problem (STPP) in graphs is a long studied&#13;
problem in combinatorial optimization. In contrast to many other problems,&#13;
where there have been tremendous advances in practical problem&#13;
solving, STPP remains very difficult. Most heuristics schemes are ineffective&#13;
and even finding feasible solutions is already NP-hard. What makes&#13;
this problem special is that in order to reach the overall optimal solution&#13;
non-optimal solutions to the underlying NP-hard Steiner tree problems&#13;
must be used. Any non-global approach to the STPP is likely to fail.&#13;
Integer programming is currently the best approach for computing optimal&#13;
solutions. In this paper we review some “classical” STPP instances&#13;
which model the underlying real world application only in a reduced form.&#13;
Through improved modelling, including some new cutting planes, and by&#13;
emplyoing recent advances in solver technology we are for the first time&#13;
able to solve those instances in the original 3D grid graphs to optimimality.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="serial">12-02</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-14625</identifier>
    <identifier type="doi">10.1007/s00186-012-0391-8</identifier>
    <enrichment key="SourceTitle">Appeared in:  Mathematical Methods of Operations Research August 2012, Volume 76, Issue 1, pp 95-123</enrichment>
    <author>Nam-Dung Hoang</author>
    <submitter>Thorsten Koch</submitter>
    <author>Thorsten Koch</author>
    <series>
      <title>ZIB-Report</title>
      <number>12-02</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Steiner tree packing</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Integer Programming</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>grid graphs</value>
    </subject>
    <collection role="msc" number="90C11">Mixed integer programming</collection>
    <collection role="msc" number="90C35">Programming involving graphs or networks [See also 90C27]</collection>
    <collection role="msc" number="90C90">Applications of mathematical programming</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="koch">Koch, Thorsten</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1462/ZR-12-02.pdf</file>
  </doc>
</export-example>
