On the Complexity of Instationary Gas Flows.

Martin Groß,Marc E. Pfetsch,Martin Skutella

Operations Research Letters（2018）

引用 1|浏览36

暂无评分

摘要

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.

查看译文

关键词

Gas transport network,Instationary gas flow,Time-dependent flow,Complexity,NP-hardness

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要