On the Complexity of Instationary Gas Flows
Optimization and Control
2017-08-30 v1 Discrete Mathematics
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.
Keywords
Cite
@article{arxiv.1708.08748,
title = {On the Complexity of Instationary Gas Flows},
author = {Martin Groß and Marc E. Pfetsch and Martin Skutella},
journal= {arXiv preprint arXiv:1708.08748},
year = {2017}
}