Computing technical capacities in the European entry-exit gas market is NP-hard

DOI10.1007/s10479-020-03725-2zbMath1451.90032OpenAlexW3048842962MaRDI QIDQ827287

Lars Schewe, Martin Schmidt, Johannes Thürauf

Publication date: 7 January 2021

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-020-03725-2

zbMATH Keywords

computational complexityNP-hardnessEuropean entry-exit gas marketpotential-based flowstechnical capacities

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10)

Related Items (6)

A bilevel optimization approach to decide the feasibility of bookings in the European gas market ⋮ On the Complexity of Computing Maximum and Minimum Min‐Cost‐Flows ⋮ A survey on bilevel optimization under uncertainty ⋮ Coordination of power and natural gas markets via financial instruments ⋮ Deciding the feasibility of a booking in the European gas market is coNP-hard ⋮ Global optimization for the multilevel European gas market system with nonlinear flow models on trees

Cites Work

• Unnamed Item
• Unnamed Item
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Structural properties of feasible bookings in the European entry-exit gas market system
• Bookings in the European gas market: characterisation of feasibility and computational complexity results
• High detail stationary optimization models for gas networks
• High detail stationary optimization models for gas networks: validation and results
• Sufficient pruning conditions for MINLP in gas network design
• A multilevel model of the European entry-exit gas market
• Robust optimal discrete arc sizing for tree-shaped potential networks
• Mixed integer models for the stationary case of gas network optimization
• Evaluating Gas Network Capacities
• Validation of nominations in gas network optimization: models, methods, and solutions
• The Gas Transmission Problem Solved by an Extension of the Simplex Algorithm
• Solving the Pipe Network Analysis Problem Using Optimization Techniques
• Solving Highly Detailed Gas Transport MINLPs: Block Separability and Penalty Alternating Direction Methods
• Algorithmic results for potential‐based flows: Easy and hard cases
• A New Algorithm for MINLP Applied to Gas Transport Energy Cost Minimization
• Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations
• Chapter 10: The precise NLP model

This page was built for publication: Computing technical capacities in the European entry-exit gas market is NP-hard