Finding Maximum Minimum Cost Flows to Evaluate Gas Network Capacities

DOI10.1007/978-3-319-89920-6_46zbMath1397.90078OpenAlexW2803232810MaRDI QIDQ4685771

Robert Schwarz, Kai Hoppmann

Publication date: 9 October 2018

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

Full work available at URL: https://doi.org/10.1007/978-3-319-89920-6_46

zbMATH Keywords

network flowsbilevel optimizationinterdiction problems

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (2)

Optimal operation of transient gas transport networks ⋮ On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows

Uses Software

• SCIP
• GasLib

Cites Work

• Unnamed Item
• Evaluating Gas Network Capacities
• Bilevel Programming Problems

This page was built for publication: Finding Maximum Minimum Cost Flows to Evaluate Gas Network Capacities