<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>3153</id>
    <completedYear>2002</completedYear>
    <publishedYear>2002</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1,10,11</pageFirst>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue>4</issue>
    <volume>35</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Making the Yellow Angels Fly</title>
    <parentTitle language="eng">SIAM News</parentTitle>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-6858</enrichment>
    <author>Martin Grötschel</author>
    <author>Sven Krumke</author>
    <author>Jörg Rambau</author>
    <author>Luis Miguel Torres</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="groetschel">Grötschel, Martin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2874</id>
    <completedYear>2008</completedYear>
    <publishedYear>2008</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany</publisherName>
    <publisherPlace>Dagstuhl, Germany</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Line Planning on Paths and Tree Networks with Applications to the Quito Trolebus System</title>
    <parentTitle language="eng">ATMOS 2008 - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems</parentTitle>
    <identifier type="url">http://drops.dagstuhl.de/opus/volltexte/2008/1580</identifier>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-10869</enrichment>
    <author>Luis Miguel Torres</author>
    <editor>Matteo Fischetti</editor>
    <author>Ramiro Torres</author>
    <editor>Peter Widmayer</editor>
    <author>Ralf Borndörfer</author>
    <author>Marc Pfetsch</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="projects" number="MATHEON-B15">MATHEON-B15</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>1107</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2008-12-18</completedDate>
    <publishedDate>2008-12-18</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Line Planning on Paths and Tree Networks with Applications to the Quito Trolebus System (Extended Abstract)</title>
    <abstract language="eng">Line planning is an important step in the strategic planning process of a public transportation system. In this paper, we discuss an optimization model for this problem in order to minimize operation costs while guaranteeing a certain level of quality of service, in terms of available transport capacity. We analyze the problem for path and tree network topologies as well as several categories of line operation that are important for the Quito Trolebus system. It turns out that, from a computational complexity worst case point of view, the problem is hard in all but the most simple variants. In practice, however, instances based on real data from the Trolebus System in Quito can be solved quite well, and significant optimization potentials can be demonstrated.</abstract>
    <identifier type="serial">08-53</identifier>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="opus3-id">1148</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-11076</identifier>
    <enrichment key="SourceTitle">Appeared in: ATMOS 2008 - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. Matteo Fischetti and Peter Widmayer (eds.)Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, Dagstuhl, Germany, 2008. http://drops.dagstuhl.de/opus/volltexte/2008/1583</enrichment>
    <author>Luis Miguel Torres</author>
    <submitter>unknown unknown</submitter>
    <author>Ramiro Torres</author>
    <author>Ralf Borndörfer</author>
    <author>Marc Pfetsch</author>
    <series>
      <title>ZIB-Report</title>
      <number>08-53</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>line planning</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>computational complexity</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>public transport</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>integer programming</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="msc" number="90C27">Combinatorial optimization</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="projects" number="MATHEON-B15">MATHEON-B15</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1107/ZR_08_53.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/1107/ZR_08_53.ps</file>
  </doc>
  <doc>
    <id>1106</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2008-12-18</completedDate>
    <publishedDate>2008-12-18</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">On the Line Planning Problem in Tree Networks</title>
    <abstract language="eng">We introduce an optimization model for the line planning problem in a public transportation system that aims at minimizing operational costs while ensuring a given level of quality of service in terms of available transport capacity. We discuss the computational complexity of the model for tree network topologies and line structures that arise in a real-world application at the Trolebus Integrated System in Quito. Computational results for this system are reported.</abstract>
    <identifier type="serial">08-52</identifier>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="opus3-id">1147</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-11069</identifier>
    <author>Luis Miguel Torres</author>
    <submitter>unknown unknown</submitter>
    <author>Ramiro Torres</author>
    <author>Ralf Borndörfer</author>
    <author>Marc Pfetsch</author>
    <series>
      <title>ZIB-Report</title>
      <number>08-52</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>line planning</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>computational complexity</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>public transport optimization</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="msc" number="90C27">Combinatorial optimization</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="projects" number="MATHEON-B1">MATHEON-B1</collection>
    <collection role="projects" number="MATHEON-B15">MATHEON-B15</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1106/ZR_08_52.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/1106/ZR_08_52.ps</file>
  </doc>
  <doc>
    <id>1086</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation>ZIB</creatingCorporation>
    <contributingCorporation>EPN Quito</contributingCorporation>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2008-08-19</completedDate>
    <publishedDate>2008-08-19</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Line Planning on Paths and Tree Networks with Applications to the Quito Trolebus System</title>
    <abstract language="eng">Line planning is an important step in the strategic planning process of a public transportation system. In this paper, we discuss an optimization model for this problem in order to minimize operation costs while guaranteeing a certain level of quality of service, in terms of available transport capacity. We analyze the problem for path and tree network topologies as well as several categories of line operation that are important for the Quito Trolebus system. It turns out that, from a computational complexity worst case point of view, the problem is hard in all but the most simple variants. In practice, however, instances based on real data from the Trolebus System in Quito can be solved quite well, and significant optimization potentials can be demonstrated.</abstract>
    <identifier type="serial">08-35</identifier>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="opus3-id">1120</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-10869</identifier>
    <enrichment key="SourceTitle">Appeared in: ATMOS 2008 - 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. Matteo Fischetti and Peter Widmayer (eds.) Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2008</enrichment>
    <author>Luis Miguel Torres</author>
    <submitter>unknown unknown</submitter>
    <author>Ramiro Torres</author>
    <author>Ralf Borndörfer</author>
    <author>Marc Pfetsch</author>
    <series>
      <title>ZIB-Report</title>
      <number>08-35</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>line planning</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>computational complexity</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>public transport</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>integer programming</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="msc" number="90B06">Transportation, logistics</collection>
    <collection role="msc" number="90C27">Combinatorial optimization</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="projects" number="MATHEON-B15">MATHEON-B15</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1086/ZR_08_35.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/1086/ZR_08_35.ps</file>
  </doc>
  <doc>
    <id>711</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2002-11-25</completedDate>
    <publishedDate>2002-11-25</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Online-Dispatching of Automobile Service Units</title>
    <abstract language="eng">We present an online algorithm for a real-world vehicle dispatching problem at ADAC, the German Automobile Association.</abstract>
    <identifier type="serial">02-44</identifier>
    <identifier type="opus3-id">712</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-7117</identifier>
    <enrichment key="SourceTitle">Appeared in: Operations Research Proceedings 2002. Selected Papers of the International Conference on Operations Research (SOR 2002), Klagenfurt, September 2-5, 2002. U. Leopold-Wildburger et al. (eds.) Berlin: Springer 2003. Pp. 168-173</enrichment>
    <author>Sven Krumke</author>
    <author>Jörg Rambau</author>
    <author>Luis Miguel Torres</author>
    <series>
      <title>ZIB-Report</title>
      <number>02-44</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>vehicle dispatching</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>soft time windows</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>online</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>real-time</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>ADAC</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="msc" number="90B06">Transportation, logistics</collection>
    <collection role="institutes" number="">ZIB Allgemein</collection>
    <collection role="projects" number="ADAC-Dispatch">ADAC-Dispatch</collection>
    <collection role="projects" number="MATHEON-C6:Online-Reopt">MATHEON-C6:Online-Reopt</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/711/ZR-02-44.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/711/ZR-02-44.pdf</file>
  </doc>
  <doc>
    <id>685</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2002-04-08</completedDate>
    <publishedDate>2002-04-08</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Making the Yellow Angels Fly: Online Dispatching Of Service Vehicles in Real Time</title>
    <abstract language="eng">Combinatorial online optimization is an area with lots of applications and potential for significant progress, both in theory and practice. In this short note we sketch the ADACproblem, a typical large-scale online optimization problem, discuss some theoretical and pratical issues coming up, and explain, very briefly, how we approach this problem mathematically. Online problems are a battlefield of heuristics with many strong claims about their solution quality. We indicate that a stronger problem orientation and the use of a little more mathematics may yield.</abstract>
    <identifier type="serial">02-18</identifier>
    <identifier type="opus3-id">686</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-6858</identifier>
    <enrichment key="SourceTitle">Appeared in: SIAM News, Vol. 35, No. 4, (2002) pp. 10-11</enrichment>
    <author>Martin Grötschel</author>
    <author>Sven Krumke</author>
    <author>Jörg Rambau</author>
    <author>Luis Miguel Torres</author>
    <series>
      <title>ZIB-Report</title>
      <number>02-18</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>vehicle dispatching</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>soft time windows</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>real-time</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>column generation</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>pricing</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>branch and bound</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>real world data</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>ADAC</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="msc" number="90B06">Transportation, logistics</collection>
    <collection role="institutes" number="">ZIB Allgemein</collection>
    <collection role="persons" number="groetschel">Grötschel, Martin</collection>
    <collection role="projects" number="ADAC-Dispatch">ADAC-Dispatch</collection>
    <collection role="projects" number="MATHEON-C6:Online-Reopt">MATHEON-C6:Online-Reopt</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/685/ZR-02-18.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/685/ZR-02-18.pdf</file>
  </doc>
  <doc>
    <id>648</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2001-09-25</completedDate>
    <publishedDate>2001-09-25</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Real-Time Dispatching of Guided and Unguided Automobile Service Units with Soft Time Windows</title>
    <abstract language="eng">Given a set of service requests (events), a set of guided servers (units), and a set of unguided service contractors (conts), the vehicle dispatching problem {\sl vdp} is the task to find an assignment of events to units and conts as well as tours for all units starting at their current positions and ending at their home positions (dispatch) such that the total cost of the dispatch is minimized. The cost of a dispatch is the sum of unit costs, cont costs, and event costs. Unit costs consist of driving costs, service costs and overtime costs; cont costs consist of a fixed cost per service; event costs consist of late costs linear in the late time, which occur whenever the service of the event starts later than its deadline. The program \textsf{ZIBDIP} based on dynamic column generation and set partitioning yields solutions on heavy-load real-world instances (215 events, 95 units) in less than a minute that are no worse than 1\% from optimum on state-of-the-art personal computers.</abstract>
    <identifier type="serial">01-22</identifier>
    <identifier type="opus3-id">649</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-6484</identifier>
    <enrichment key="SourceTitle">Appeared in: Algorithms - ESA 2002. Proceedings of the 10th European Symposium on Algorithms, Rome, Italy, September 17-21, 2002. R. Möhring et al. (eds.) Berlin: Springer 2002. LNCS 2461, pp. 637-648</enrichment>
    <author>Sven Krumke</author>
    <author>Jörg Rambau</author>
    <author>Luis Miguel Torres</author>
    <series>
      <title>ZIB-Report</title>
      <number>01-22</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>vehicle dispatching</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>soft time windows</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>real-time</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>column generation</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>pricing</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>branch and bound</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>real world data</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>ADAC</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="msc" number="90B06">Transportation, logistics</collection>
    <collection role="institutes" number="">ZIB Allgemein</collection>
    <collection role="projects" number="ADAC-Dispatch">ADAC-Dispatch</collection>
    <collection role="projects" number="MATHEON-C6:Online-Reopt">MATHEON-C6:Online-Reopt</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/648/ZR-01-22.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/648/ZR-01-22.pdf</file>
  </doc>
</export-example>
