Deciding the feasibility of a booking in the European gas market is coNP-hard
type: Item
instance of: scholarly article
title: Deciding the feasibility of a booking in the European gas market is coNP-hard
zbMATH Open document ID: 1502.90038
author: Johannes Thürauf
published in: Annals of Operations Research
publication date: 2022-11-15T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 7617092
zbMATH Keywords: potential-based flows
zbMATH Keywords: gas networks
zbMATH Keywords: computational complexity
zbMATH Keywords: European entry-exit market
zbMATH Keywords: bookings
MaRDI profile type: Publication
full work available at URL: s10479-022-04732-1
OpenAlex ID: W4283736341
cites work: Q3056948
cites work: Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations
cites work: Q3182207
cites work: An exact formula for radius of robust feasibility of uncertain linear programs
cites work: The Gas Transmission Problem Solved by an Extension of the Simplex Algorithm
cites work: Combination of nonlinear and linear optimization of transient gas networks
cites work: A New Algorithm for MINLP Applied to Gas Transport Energy Cost Minimization
cites work: Solving Highly Detailed Gas Transport MINLPs: Block Separability and Penalty Alternating Direction Methods
cites work: Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty
cites work: On the quantification of nomination feasibility in stationary gas networks with random load
cites work: A multilevel model of the European entry-exit gas market
cites work: Algorithmic results for potential‐based flows: Easy and hard cases
cites work: Challenges in Optimal Control Problems for Gas and Fluid Flow in Networks of Pipes and Canals: From Modeling to Industrial Applications
cites work: Evaluating Gas Network Capacities
cites work: Bookings in the European gas market: characterisation of feasibility and computational complexity results
cites work: Deciding feasibility of a booking in the European gas market on a cycle is in P for the case of passive networks
cites work: Radius of Robust Feasibility for Mixed-Integer Problems
cites work: A reduction technique for natural gas transmission network optimization problems
cites work: Robust optimal discrete arc sizing for tree-shaped potential networks
cites work: Computational optimization of gas compressor stations: MINLP models versus continuous reformulations
cites work: Structural properties of feasible bookings in the European entry-exit gas market system
cites work: Computing technical capacities in the European entry-exit gas market is NP-hard
cites work: High detail stationary optimization models for gas networks
cites work: High detail stationary optimization models for gas networks: validation and results
DOI: 10.1007/S10479-022-04732-1
description: scientific article; zbMATH DE number 7617092