Deciding Feasibility of a Booking in the European Gas Market on a Cycle is in P

Martine Labbé 1 Fränk Plein 2, 3 Martin Schmidt 4 Johannes Thürauf 5
1 INOCS - Integrated Optimization with Complex Structure
ULB - Université Libre de Bruxelles [Bruxelles], Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Abstract : We show that the feasibility of a booking in the European entry-exit gas market can be decided in polynomial time on single-cycle networks. The feasibility of a booking can be characterized by solving polynomially many nonlinear potential-based flow models for computing so-called potential-difference maximizing load flow scenarios. We thus analyze the structure of these models and exploit both the cyclic graph structure as well as specific properties of potential-based flows. This enables us to solve the decision variant of the nonlinear potential-difference maximization by reducing it to a system of polynomials of constant dimension that is independent of the cycle's size. This system of fixed dimension can be handled with tools from real algebraic geometry to derive a polynomial-time algorithm. The characterization in terms of potential-difference maximizing load flow scenarios then leads to a polynomial-time algorithm for deciding the feasibility of a booking. Our theoretical results extend the existing knowledge about the complexity of deciding the feasibility of bookings from trees to single-cycle networks.
Complete list of metadatas

Cited literature [46 references]  Display  Hide  Download
Contributor : Fränk Plein <>
Submitted on : Wednesday, November 13, 2019 - 10:40:12 AM
Last modification on : Tuesday, November 19, 2019 - 5:30:45 PM


Files produced by the author(s)


  • HAL Id : hal-02360972, version 1



Martine Labbé, Fränk Plein, Martin Schmidt, Johannes Thürauf. Deciding Feasibility of a Booking in the European Gas Market on a Cycle is in P. 2019. ⟨hal-02360972⟩



Record views


Files downloads