Deciding the feasibility of a booking in the European gas market is coNP-hard (Q2095927): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact formula for radius of robust feasibility of uncertain linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Gas Transmission Problem Solved by an Extension of the Simplex Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combination of Nonlinear and Linear Optimization of Transient Gas Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for MINLP Applied to Gas Transport Energy Cost Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Highly Detailed Gas Transport MINLPs: Block Separability and Penalty Alternating Direction Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Solutions of MultiObjective Linear Semi-Infinite Programs under Constraint Data Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the quantification of nomination feasibility in stationary gas networks with random load / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multilevel model of the European entry-exit gas market / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic results for potential‐based flows: Easy and hard cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Challenges in Optimal Control Problems for Gas and Fluid Flow in Networks of Pipes and Canals: From Modeling to Industrial Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating Gas Network Capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bookings in the European gas market: characterisation of feasibility and computational complexity results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding feasibility of a booking in the European gas market on a cycle is in P for the case of passive networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radius of Robust Feasibility for Mixed-Integer Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reduction technique for natural gas transmission network optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust optimal discrete arc sizing for tree-shaped potential networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational optimization of gas compressor stations: MINLP models versus continuous reformulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural properties of feasible bookings in the European entry-exit gas market system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing technical capacities in the European entry-exit gas market is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: High detail stationary optimization models for gas networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: High detail stationary optimization models for gas networks: validation and results / rank
 
Normal rank

Latest revision as of 19:49, 30 July 2024

scientific article
Language Label Description Also known as
English
Deciding the feasibility of a booking in the European gas market is coNP-hard
scientific article

    Statements

    Deciding the feasibility of a booking in the European gas market is coNP-hard (English)
    0 references
    0 references
    15 November 2022
    0 references
    potential-based flows
    0 references
    gas networks
    0 references
    computational complexity
    0 references
    European entry-exit market
    0 references
    bookings
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references