Deciding the feasibility of a booking in the European gas market is coNP-hard
From MaRDI portal
Publication:2095927
DOI10.1007/s10479-022-04732-1zbMath1502.90038OpenAlexW4283736341MaRDI QIDQ2095927
Publication date: 15 November 2022
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-022-04732-1
Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- On the quantification of nomination feasibility in stationary gas networks with random load
- Computational optimization of gas compressor stations: MINLP models versus continuous reformulations
- Computing technical capacities in the European entry-exit gas market is NP-hard
- A reduction technique for natural gas transmission network optimization problems
- 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
- An exact formula for radius of robust feasibility of uncertain linear programs
- A multilevel model of the European entry-exit gas market
- Robust optimal discrete arc sizing for tree-shaped potential networks
- Combination of Nonlinear and Linear Optimization of Transient Gas Networks
- Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty
- Evaluating Gas Network Capacities
- The Gas Transmission Problem Solved by an Extension of the Simplex Algorithm
- Challenges in Optimal Control Problems for Gas and Fluid Flow in Networks of Pipes and Canals: From Modeling to Industrial Applications
- Radius of Robust Feasibility for Mixed-Integer Problems
- 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
- Deciding feasibility of a booking in the European gas market on a cycle is in P for the case of passive networks
This page was built for publication: Deciding the feasibility of a booking in the European gas market is coNP-hard
