Finding maximum minimum cost flows to evaluate gas network capacities

DOI10.1007/978-3-319-89920-6_46MaRDI QIDQ4685771zbMATH OpenOpenAlexFDO

Authors Kai Hoppmann, Robert Schwarz

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

bilevel optimizationinterdiction problemsnetwork flows

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• Minimum flow variation in maximum flows
• A system to evaluate gas network capacities: concepts and implementation
• Computing maximal entry and exit capacities of transportation networks. Complexity analysis and a discrete relaxation applied to gas transmission systems
• scientific article; zbMATH DE number 903085
• Optimization of capacity expansion planning for gas transportation networks

Cites work

• Bilevel programming problems. Theory, algorithms and applications to energy networks
• Evaluating Gas Network Capacities
• Network flows. Theory, algorithms, and applications.

Cited in

(3)

• Optimal operation of transient gas transport networks
• Evaluating Gas Network Capacities
• On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows

Describes a project that uses

Uses Software

• SCIP
• GasLib

This page was built for publication: Finding maximum minimum cost flows to evaluate gas network capacities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4685771)