| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 7543792 | Operations Research Letters | 2018 | 5 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Martin GroÃ, Marc E. Pfetsch, Martin Skutella,