Pages that link to "Item:Q5226171"

The following pages link to Algorithmic results for potential‐based flows: Easy and hard cases (Q5226171):

Displaying 17 items.

• Computing technical capacities in the European entry-exit gas market is NP-hard (Q827287) (← links)
• The cost of decoupling trade and transport in the European entry-exit gas market with linear physics modeling (Q2060426) (← links)
• Fractionally subadditive maximization under an incremental knapsack constraint (Q2085751) (← links)
• Deciding the feasibility of a booking in the European gas market is coNP-hard (Q2095927) (← links)
• Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph (Q2097180) (← links)
• Global optimization for the multilevel European gas market system with nonlinear flow models on trees (Q2114602) (← links)
• A bilevel optimization approach to decide the feasibility of bookings in the European gas market (Q2155380) (← links)
• Structural properties of feasible bookings in the European entry-exit gas market system (Q2190798) (← links)
• The impact of potential-based physics models on pricing in energy networks (Q2201307) (← links)
• A note on integral generalized flows in directed partial 2-trees (Q2234778) (← links)
• Bookings in the European gas market: characterisation of feasibility and computational complexity results (Q2303532) (← links)
• Robust optimal discrete arc sizing for tree-shaped potential networks (Q2419569) (← links)
• On the robustness of potential-based flow networks (Q2689822) (← links)
• Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs (Q5076726) (← links)
• Combinatorial acyclicity models for potential‐based flows (Q6065854) (← links)
• Deciding feasibility of a booking in the European gas market on a cycle is in P for the case of passive networks (Q6087149) (← links)
• Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows (Q6202753) (← links)