<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>5364</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-12-02</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Computing D-optimal experimental designs for estimating treatment contrasts under the presence of a nuisance time trend</title>
    <abstract language="eng">We prove a mathematical programming characterisation of approximate partial D-optimality under general linear constraints. We use this characterisation with a branch-and-bound method to compute a list of all exact D-optimal designs for estimating a pair of treatment contrasts in the presence of a nuisance time trend up to the size of 24 consecutive trials.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="doi">10.1007/978-3-319-13881-7_10</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-53640</identifier>
    <enrichment key="SourceTitle">Appeared in: Stochastic Models, Statistics and Their ApplicationsSpringer Proceedings in Mathematics &amp; Statistics Volume 122, 2015, pp 83-91</enrichment>
    <author>Radoslav Harman</author>
    <submitter>Guillaume Sagnol</submitter>
    <author>Guillaume Sagnol</author>
    <series>
      <title>ZIB-Report</title>
      <number>15-02</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>optimal design of experiments</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>nuisance trend</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>branch and bound</value>
    </subject>
    <collection role="msc" number="62-XX">STATISTICS</collection>
    <collection role="msc" number="90-XX">OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="institutes" number="traffic">Mathematics of Transportation and Logistics</collection>
    <collection role="persons" number="sagnol">Sagnol, Guillaume</collection>
    <collection role="projects" number="ZIB-OptDes">ZIB-OptDes</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/5364/POP-SMSA-ZIB.pdf</file>
  </doc>
  <doc>
    <id>1549</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-05-31</completedDate>
    <publishedDate>2012-05-31</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Case Study on Optimizing Toll Enforcements on Motorways</title>
    <abstract language="eng">In this paper we present the problem of computing optimal tours of toll inspectors on German motorways. This problem is a special type of vehicle routing problem and builds up an integrated model, consisting of a tour&#13;
planning and a duty rostering part. The tours should guarantee a network-wide control whose intensity is proportional to given spatial and time dependent traffic distributions. We model this using a space-time network&#13;
and formulate the associated optimization problem by an integer program (IP). Since sequential approaches fail, we integrated the assignment of crews to the tours in our model. In this process all duties of a crew member must fit in a feasible roster. It is modeled as a Multi-Commodity Flow Problem in a directed acyclic graph, where specific paths correspond to&#13;
feasible rosters for one month. We present computational results in a&#13;
case-study on a German subnetwork which documents the practicability of our approach.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-15498</identifier>
    <identifier type="doi">10.4230/OASIcs.SCOR.2012.1</identifier>
    <enrichment key="SourceTitle">Appeared in: 3rd Student Conference on Operational Research. S. Ravizza, P. Holborn (eds.) Open Acess Series in Informatics 22 (2012) pp. 1-10</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Elmar Swarat</submitter>
    <author>Guillaume Sagnol</author>
    <author>Elmar Swarat</author>
    <series>
      <title>ZIB-Report</title>
      <number>12-21</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Vehicle Routing Problem</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Duty Rostering</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Integer Programming</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Operations Research</value>
    </subject>
    <collection role="ccs" number="G.2.3">Applications (NEW)</collection>
    <collection role="msc" number="90B06">Transportation, logistics</collection>
    <collection role="msc" number="90C10">Integer programming</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="persons" number="sagnol">Sagnol, Guillaume</collection>
    <collection role="persons" number="swarat">Swarat, Elmar</collection>
    <collection role="projects" number="TOLLCONTROLOPT">TOLLCONTROLOPT</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1549/ZR-12-21.pdf</file>
  </doc>
  <doc>
    <id>1499</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-04-10</completedDate>
    <publishedDate>2012-04-10</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Stackelberg game to optimize the distribution of controls in transportation networks</title>
    <abstract language="eng">We propose a game theoretic model for the spatial distribution of inspectors on a&#13;
transportation network.&#13;
The problem is to spread out the controls so as to enforce the payment of a transit&#13;
toll. We formulate a linear program to find&#13;
the control distribution which maximizes the expected toll revenue,&#13;
and a mixed integer program for the problem of minimizing&#13;
the number of evaders. Furthermore, we show that the problem of finding an optimal&#13;
mixed strategy for a coalition of $N$ inspectors can be solved&#13;
efficiently by a column generation procedure. Finally, we give experimental results&#13;
from an application to the truck toll on German motorways.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-14995</identifier>
    <identifier type="doi">10.1007/978-3-642-35582-0_17</identifier>
    <enrichment key="SourceTitle">A rev. vers. appeared in: Proceedings of the 3rd International Conference on Game Theory for Networks (GAMENETS 2012), volume 105 of Lecture Notes of the ICST, pp. 224 – 235, Vancouver, Canada, May 2012</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Guillaume Sagnol</submitter>
    <author>Bertrand Omont</author>
    <author>Guillaume Sagnol</author>
    <author>Elmar Swarat</author>
    <series>
      <title>ZIB-Report</title>
      <number>12-15</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Stackelberg game</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Polymatrix game</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Controls in transportation networks</value>
    </subject>
    <collection role="msc" number="90-XX">OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="persons" number="sagnol">Sagnol, Guillaume</collection>
    <collection role="persons" number="swarat">Swarat, Elmar</collection>
    <collection role="projects" number="TOLLCONTROLOPT">TOLLCONTROLOPT</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1499/zib_report_12_15.pdf</file>
  </doc>
  <doc>
    <id>5540</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-06-18</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">An Extended Network Interdiction Problem for Optimal Toll Control</title>
    <abstract language="eng">We study an extension of the shortest path network interdiction problem and present a novel real-world application in this area. We consider the problem of determining optimal locations for toll control stations on the arcs of a transportation network. We handle the fact that drivers can avoid control stations on parallel secondary roads. The problem is formulated as a mixed integer program and solved using Benders decomposition. We present experimental results for the application of our models to German motorways.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-55405</identifier>
    <identifier type="doi">10.1016/j.endm.2016.03.040</identifier>
    <enrichment key="SourceTitle">Appeared in: Electronic Notes in Discrete Mathematics  Volume 52, June 2016, Pages 301–308  INOC 2015 – 7th International Network Optimization Conference</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Stephan Schwartz</submitter>
    <author>Guillaume Sagnol</author>
    <author>Stephan Schwartz</author>
    <series>
      <title>ZIB-Report</title>
      <number>15-32</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>network interdiction</value>
    </subject>
    <collection role="msc" number="90-XX">OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="persons" number="sagnol">Sagnol, Guillaume</collection>
    <collection role="persons" number="schwartz">Schwartz, Stephan</collection>
    <collection role="projects" number="TOLLCONTROLOPT">TOLLCONTROLOPT</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/5540/ZIB_Report_15_32.pdf</file>
  </doc>
  <doc>
    <id>4510</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>2013-12-18</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Optimal Toll Enforcement - an Integration of Vehicle Routing and Duty Rostering</title>
    <abstract language="eng">We present the problem of planning mobile tours of inspectors on German motorways to enforce the payment of the toll for heavy good trucks. This is a special type of vehicle routing problem with the objective to conduct as good inspections as possible on the complete network. In addition, the crews of the tours have to be scheduled. Thus, we developed a personalized crew rostering model. The planning of daily tours and the rostering are combined in a novel integrated approach and formulated as a complex and large scale Integer Program. The paper focuses first on different requirements for the rostering and how they can be modeled in detail. The second focus is on a bicriterion analysis of the planning problem to find the balance between the control quality and the roster acceptance. On the one hand the tour planning is a profit maximization problem and on the other hand the rostering should be made in a employee friendly way. Finally, computational results on real-world instances show the practicability of our method.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-45107</identifier>
    <identifier type="doi">10.1007/s10479-016-2152-1</identifier>
    <enrichment key="SourceTitle">Appeared in: Annals of Operations Research (2016)</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Elmar Swarat</submitter>
    <author>Guillaume Sagnol</author>
    <author>Thomas Schlechte</author>
    <author>Elmar Swarat</author>
    <series>
      <title>ZIB-Report</title>
      <number>13-79</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>vehicle routing</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>crew rostering</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>integer programming</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>bicriteria optimization</value>
    </subject>
    <collection role="msc" number="90B20">Traffic problems</collection>
    <collection role="msc" number="90C06">Large-scale problems</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="persons" number="sagnol">Sagnol, Guillaume</collection>
    <collection role="persons" number="schlechte">Schlechte, Thomas</collection>
    <collection role="persons" number="swarat">Swarat, Elmar</collection>
    <collection role="projects" number="TOLLCONTROLOPT">TOLLCONTROLOPT</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/4510/ZR-13-79.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/4510/ZR-13-79_revised.pdf</file>
  </doc>
  <doc>
    <id>5280</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>2014-10-15</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Optimal Designs for Steady-state Kalman filters</title>
    <abstract language="eng">We consider a stationary discrete-time linear process that can be observed by a finite number of sensors.&#13;
The experimental design for the observations consists of an allocation of available resources to these sensors.&#13;
We formalize the problem of selecting a design that maximizes the information matrix of the steady-state of the Kalman filter,&#13;
with respect to a standard optimality criterion, such as $D-$ or $A-$optimality.&#13;
This problem generalizes the optimal experimental design problem for a linear regression model with a finite design space and uncorrelated errors.&#13;
Finally, we show that under natural assumptions, a steady-state optimal design can be computed by semidefinite programming.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-52808</identifier>
    <author>Guillaume Sagnol</author>
    <submitter>Guillaume Sagnol</submitter>
    <author>Radoslav Harman</author>
    <series>
      <title>ZIB-Report</title>
      <number>14-39</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Optimal Design</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Kalman Filter</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Semidefinite programming</value>
    </subject>
    <collection role="msc" number="93-XX">SYSTEMS THEORY; CONTROL (For optimal control, see 49-XX)</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="institutes" number="traffic">Mathematics of Transportation and Logistics</collection>
    <collection role="persons" number="sagnol">Sagnol, Guillaume</collection>
    <collection role="projects" number="ZIB-OptDes">ZIB-OptDes</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/5280/optdes_filtering_smsa-zib.pdf</file>
  </doc>
</export-example>
