Computing technical capacities in the European entry-exit gas market is NP-hard (Q827287): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10479-020-03725-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3048842962 / 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: Solving the Pipe Network Analysis Problem Using Optimization Techniques / 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: 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: 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: Q4605721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient pruning conditions for MINLP in gas network design / 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: Mixed integer models for the stationary case of gas network optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of nominations in gas network optimization: models, methods, and solutions / 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: Structural properties of feasible bookings in the European entry-exit gas market system / 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: Chapter 10: The precise NLP model / rank
 
Normal rank
Property / cites work
 
Property / cites work: High detail stationary optimization models for gas networks: validation and results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank

Latest revision as of 06:37, 24 July 2024

scientific article
Language Label Description Also known as
English
Computing technical capacities in the European entry-exit gas market is NP-hard
scientific article

    Statements

    Computing technical capacities in the European entry-exit gas market is NP-hard (English)
    0 references
    0 references
    0 references
    0 references
    7 January 2021
    0 references
    European entry-exit gas market
    0 references
    technical capacities
    0 references
    potential-based flows
    0 references
    computational complexity
    0 references
    NP-hardness
    0 references
    0 references
    0 references

    Identifiers

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