000843741 001__ 843741
000843741 005__ 20240711101552.0
000843741 0247_ $$2doi$$a10.1007/s10589-019-00085-x
000843741 0247_ $$2ISSN$$a0926-6003
000843741 0247_ $$2ISSN$$a1573-2894
000843741 0247_ $$2altmetric$$aaltmetric:58237447
000843741 0247_ $$2WOS$$aWOS:000468828300003
000843741 037__ $$aFZJ-2018-01293
000843741 082__ $$a510
000843741 1001_ $$0P:(DE-Juel1)156460$$aRobinius, Martin$$b0
000843741 245__ $$aRobust Optimal Discrete Arc Sizing for Tree-Shaped Potential Networks
000843741 260__ $$aNew York, NY [u.a.]$$bSpringer Science + Business Media B.V.$$c2019
000843741 3367_ $$2DRIVER$$aarticle
000843741 3367_ $$2DataCite$$aOutput Types/Journal article
000843741 3367_ $$0PUB:(DE-HGF)16$$2PUB:(DE-HGF)$$aJournal Article$$bjournal$$mjournal$$s1559896646_27796
000843741 3367_ $$2BibTeX$$aARTICLE
000843741 3367_ $$2ORCID$$aJOURNAL_ARTICLE
000843741 3367_ $$00$$2EndNote$$aJournal Article
000843741 520__ $$aWe 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.
000843741 536__ $$0G:(DE-HGF)POF3-134$$a134 - Electrolysis and Hydrogen (POF3-134)$$cPOF3-134$$fPOF III$$x0
000843741 588__ $$aDataset connected to CrossRef
000843741 7001_ $$0P:(DE-HGF)0$$aSchewe, Lars$$b1
000843741 7001_ $$0P:(DE-HGF)0$$aSchmidt, Martin$$b2$$eCorresponding author
000843741 7001_ $$0P:(DE-Juel1)129928$$aStolten, Detlef$$b3
000843741 7001_ $$0P:(DE-Juel1)171366$$aThürauf, Johannes$$b4
000843741 7001_ $$0P:(DE-Juel1)165160$$aWelder, Lara$$b5
000843741 773__ $$0PERI:(DE-600)1467967-x$$a10.1007/s10589-019-00085-x$$n3$$p791-819$$tComputational optimization and applications$$v73$$x0926-6003$$y2019
000843741 8564_ $$uhttps://juser.fz-juelich.de/record/843741/files/Robinius2019_Article_RobustOptimalDiscreteArcSizing.pdf$$yRestricted
000843741 8564_ $$uhttps://juser.fz-juelich.de/record/843741/files/Robinius2019_Article_RobustOptimalDiscreteArcSizing.pdf?subformat=pdfa$$xpdfa$$yRestricted
000843741 909CO $$ooai:juser.fz-juelich.de:843741$$pVDB
000843741 9101_ $$0I:(DE-588b)5008462-8$$6P:(DE-Juel1)156460$$aForschungszentrum Jülich$$b0$$kFZJ
000843741 9101_ $$0I:(DE-588b)5008462-8$$6P:(DE-Juel1)129928$$aForschungszentrum Jülich$$b3$$kFZJ
000843741 9101_ $$0I:(DE-588b)5008462-8$$6P:(DE-Juel1)165160$$aForschungszentrum Jülich$$b5$$kFZJ
000843741 9131_ $$0G:(DE-HGF)POF3-134$$1G:(DE-HGF)POF3-130$$2G:(DE-HGF)POF3-100$$3G:(DE-HGF)POF3$$4G:(DE-HGF)POF$$aDE-HGF$$bEnergie$$lSpeicher und vernetzte Infrastrukturen$$vElectrolysis and Hydrogen$$x0
000843741 9141_ $$y2019
000843741 915__ $$0StatID:(DE-HGF)0420$$2StatID$$aNationallizenz
000843741 915__ $$0StatID:(DE-HGF)0200$$2StatID$$aDBCoverage$$bSCOPUS
000843741 915__ $$0StatID:(DE-HGF)0300$$2StatID$$aDBCoverage$$bMedline
000843741 915__ $$0StatID:(DE-HGF)0100$$2StatID$$aJCR$$bCOMPUT OPTIM APPL : 2015
000843741 915__ $$0StatID:(DE-HGF)0199$$2StatID$$aDBCoverage$$bThomson Reuters Master Journal List
000843741 915__ $$0StatID:(DE-HGF)0110$$2StatID$$aWoS$$bScience Citation Index
000843741 915__ $$0StatID:(DE-HGF)0150$$2StatID$$aDBCoverage$$bWeb of Science Core Collection
000843741 915__ $$0StatID:(DE-HGF)0111$$2StatID$$aWoS$$bScience Citation Index Expanded
000843741 915__ $$0StatID:(DE-HGF)1160$$2StatID$$aDBCoverage$$bCurrent Contents - Engineering, Computing and Technology
000843741 915__ $$0StatID:(DE-HGF)9900$$2StatID$$aIF < 5
000843741 920__ $$lyes
000843741 9201_ $$0I:(DE-Juel1)IEK-3-20101013$$kIEK-3$$lElektrochemische Verfahrenstechnik$$x0
000843741 980__ $$ajournal
000843741 980__ $$aVDB
000843741 980__ $$aI:(DE-Juel1)IEK-3-20101013
000843741 980__ $$aUNRESTRICTED
000843741 981__ $$aI:(DE-Juel1)ICE-2-20101013