Algorithmic results for potential‐based flows: Easy and hard cases
From MaRDI portal
Publication:5226171
DOI10.1002/net.21865zbMath1418.90055OpenAlexW2905726056MaRDI QIDQ5226171
Marc E. Pfetsch, Martin Skutella, Martin Schmidt, Martin Groß, Lars Schewe
Publication date: 30 July 2019
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21865
network reductionNP-hardnessseries-parallel graphsmaximum flow problempotential-based flowspotential networks
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items (17)
Computing technical capacities in the European entry-exit gas market is NP-hard ⋮ A bilevel optimization approach to decide the feasibility of bookings in the European gas market ⋮ Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs ⋮ Robust optimal discrete arc sizing for tree-shaped potential networks ⋮ Combinatorial acyclicity models for potential‐based flows ⋮ Structural properties of feasible bookings in the European entry-exit gas market system ⋮ Deciding feasibility of a booking in the European gas market on a cycle is in P for the case of passive networks ⋮ On the robustness of potential-based flow networks ⋮ Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows ⋮ The impact of potential-based physics models on pricing in energy networks ⋮ A note on integral generalized flows in directed partial 2-trees ⋮ Bookings in the European gas market: characterisation of feasibility and computational complexity results ⋮ The cost of decoupling trade and transport in the European entry-exit gas market with linear physics modeling ⋮ Fractionally subadditive maximization under an incremental knapsack constraint ⋮ Deciding the feasibility of a booking in the European gas market is coNP-hard ⋮ Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph ⋮ Global optimization for the multilevel European gas market system with nonlinear flow models on trees
This page was built for publication: Algorithmic results for potential‐based flows: Easy and hard cases
