% IMPORTANT: The following is UTF-8 encoded.  This means that in the presence
% of non-ASCII characters, it will not work with BibTeX 0.99 or older.
% Instead, you should use an up-to-date BibTeX implementation like “bibtex8” or
% “biber”.

@ARTICLE{Robinius:843741,
      author       = {Robinius, Martin and Schewe, Lars and Schmidt, Martin and
                      Stolten, Detlef and Thürauf, Johannes and Welder, Lara},
      title        = {{R}obust {O}ptimal {D}iscrete {A}rc {S}izing for
                      {T}ree-{S}haped {P}otential {N}etworks},
      journal      = {Computational optimization and applications},
      volume       = {73},
      number       = {3},
      issn         = {0926-6003},
      address      = {New York, NY [u.a.]},
      publisher    = {Springer Science + Business Media B.V.},
      reportid     = {FZJ-2018-01293},
      pages        = {791-819},
      year         = {2019},
      abstract     = {We consider the problem of discrete arc sizing for
                      tree-shaped potential networks with respect to infinitely
                      many demand scenarios. This means that the arc sizes need to
                      be feasible for an infinite set of scenarios. The problem
                      can be seen as a strictly robust counterpart of a
                      single-scenario network design problem, which is shown to be
                      NP-complete even on trees. In order to obtain a tractable
                      problem, we introduce a method for generating a finite
                      scenario set such that optimality of a sizing for this
                      finite set implies the sizing’s optimality for the
                      originally given infinite set of scenarios. We further prove
                      that the size of the finite scenario set is quadratically
                      bounded above in the number of nodes of the underlying tree
                      and that it can be computed in polynomial time. The
                      resulting problem can then be solved as a standard
                      mixed-integer linear optimization problem. Finally, we show
                      the applicability of our theoretical results by computing
                      globally optimal arc sizes for a realistic hydrogen
                      transport network of Eastern Germany.},
      cin          = {IEK-3},
      ddc          = {510},
      cid          = {I:(DE-Juel1)IEK-3-20101013},
      pnm          = {134 - Electrolysis and Hydrogen (POF3-134)},
      pid          = {G:(DE-HGF)POF3-134},
      typ          = {PUB:(DE-HGF)16},
      UT           = {WOS:000468828300003},
      doi          = {10.1007/s10589-019-00085-x},
      url          = {https://juser.fz-juelich.de/record/843741},
}