On the complexity of instationary gas flows

DOI10.1016/j.orl.2018.01.007OpenAlexW2751970538MaRDI QIDQ2417151

Martin Skutella, Marc E. Pfetsch, Martin Groß

Publication date: 11 June 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.08748

zbMATH Keywords

complexityNP-hardnesstime-dependent flowgas transport networkinstationary gas flow

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items

Transient gas pipeline flow: analytical examples, numerical simulation and a comparison to the quasi-static approach

Cites Work

• Evaluating Gas Network Capacities
• An Introduction to Network Flows over Time
• Solving the Pipe Network Analysis Problem Using Optimization Techniques
• Braess's paradox and power-law nonlinearities in networks