On the Complexity of Instationary Gas Flows

DOI10.1016/J.ORL.2018.01.007MaRDI QIDQ6290629arXivFDO

Authors Martin Groß, Marc E. Pfetsch, Martin Skutella

Publication date 29 August 2017

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.ORL.2018.01.007

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Applications of mathematical programming (90C90)

arXiv classification

cs.DMmath.OC

Abstract: We study a simplistic model of instationary gas flows consisting of a sequence of k stationary gas flows. We present efficiently solvable cases and NP-hardness results, establishing complexity gaps between stationary and instationary gas flows (already for k=2) as well as between instationary gas s-t-flows and instationary gas b-flows.

This page was built for publication: On the Complexity of Instationary Gas Flows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6290629)