<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>8095</id>
    <completedYear>2020</completedYear>
    <publishedYear>2020</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2020-12-01</completedDate>
    <publishedDate>2020-12-01</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">An FPTAS for Dynamic Multiobjective Shortest Path Problems</title>
    <abstract language="eng">We propose in this paper the Dynamic Multiobjective Shortest Problem. It features multidimensional states that can depend on several variables and not only on time; this setting is  motivated by flight planning and electric vehicle routing applications. We give an exact algorithm for the FIFO case and derive from it an FPTAS, which is computationally efficient. It also features the best known complexity in the static case.</abstract>
    <identifier type="urn">urn:nbn:de:0297-zib-80954</identifier>
    <identifier type="doi">https://doi.org/10.3390/a14020043</identifier>
    <enrichment key="SourceTitle">Appeared in Algorithms 2021, 14(2), 43</enrichment>
    <author>Pedro Maristany de las Casas</author>
    <submitter>Pedro Maristany de las Casas</submitter>
    <author>Ralf Borndörfer</author>
    <author>Luitgard Kraus</author>
    <author>Antonio Sedeño-Noda</author>
    <series>
      <title>ZIB-Report</title>
      <number>20-31</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Multiobjective Shortest Paths</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Time Dependent Shortest Paths</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Multiobjective Approximation Algorithms</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Flight Planning Problem</value>
    </subject>
    <collection role="msc" number="90B99">None of the above, but in this section</collection>
    <collection role="msc" number="90C29">Multi-objective and goal programming</collection>
    <collection role="msc" number="90C35">Programming involving graphs or networks [See also 90C27]</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="projects" number="LHS-ATN">LHS-ATN</collection>
    <collection role="persons" number="maristany">Maristany de las Casas, Pedro</collection>
    <collection role="projects" number="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="institutes" number="neo">Network Optimization</collection>
    <thesisPublisher>Zuse Institute Berlin (ZIB)</thesisPublisher>
    <file>https://opus4.kobv.de/opus4-zib/files/8095/main.pdf</file>
  </doc>
</export-example>
