On the complexity of instationary gas flows

DOI10.1016/J.ORL.2018.01.007OpenAlexW2751970538MaRDI QIDQ2417151FDOQ2417151

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

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

Recommendations

• Gas flow in pipeline networks
• An economic method for simulating steady-state conditions in gas transport systems
• scientific article; zbMATH DE number 2231506
• Multicommodity flows over time: Efficient algorithms and complexity
• scientific article; zbMATH DE number 3894722

zbMATH Keywords

complexityNP-hardnesstime-dependent flowgas transport networkinstationary gas flow

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Solving the Pipe Network Analysis Problem Using Optimization Techniques
• An introduction to network flows over time
• Evaluating Gas Network Capacities
• Braess's paradox and power-law nonlinearities in networks

Cited In (4)

• Transient gas pipeline flow: analytical examples, numerical simulation and a comparison to the quasi-static approach
• On Gas Dynamic Hierarchy
• Title not available (Why is that?)
• On the Complexity of Instationary Gas 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 Q2417151)