Battery Energy Management of a Telecommunications Company to Participate in the Curtailment Market and Reduce the Total Energy Cost

Autor: Cédric Bentz, Safia Kedad-Sidhoum, Matthieu Chardy, Mustapha Bouhtou, Isaias Faria Silva

Publikováno v: 2020 IEEE 8th International Conference on Smart Energy Grid Engineering (SEGE)
2020 IEEE 8th International Conference on Smart Energy Grid Engineering (SEGE), Aug 2020, Oshawa, France. pp.121-127, ⟨10.1109/SEGE49949.2020.9181937⟩

The use of batteries as a backup in case of power outages is frequent in telecommunications companies that need to keep their services always active. Also, these batteries can be used when the energy costs more, to reduce the electricity bill, as lon

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1c8314b34d9d7838b11de2d615a077c8
https://doi.org/10.1109/sege49949.2020.9181937

Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid

Autor: Cédric Bentz, Rico Zenklusen, Marie-Christine Costa, D. de Werra, Bernard Ries, Christophe Picouleau

Publikováno v: Discrete Mathematics
Discrete Mathematics, Elsevier, 2010, 310, pp.132--146. ⟨10.1016/j.disc.2009.08.009⟩

Given an undirected graph G = (V, E) with matching number nu(G), a d-blocker is a subset of edges B such that nu((V, E \ B)) = d. While the associated decision problem is NP-complete in bipartite graphs we show how to construct efficiently minimum d-

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::89f257dc738495d993b15977b349e296
http://doc.rero.ch/record/326878/files/blockersandtransversalsii.pdf

Blockers and transversals

Autor: Rico Zenklusen, Marie-Christine Costa, Bernard Ries, Christophe Picouleau, Cédric Bentz, D. de Werra

Publikováno v: Discrete Mathematics
Discrete Mathematics, Elsevier, 2009, 13, pp.4306--4314. ⟨10.1016/j.disc.2009.01.006⟩

Given an undirected graph G = (V, E) with matching number v(G), we define d-blockers as subsets of edges B such that nu((V, E \ B)) = d. We explore connections between d-blockers and d-transversals. Special classes of graphs are examined which includ

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e90a19ef38d615e7d7d472538756a94d
http://doc.rero.ch/record/324622/files/blockersandtransversalsi.pdf

An FPT algorithm in polynomial space for the Directed Steiner Tree problem with Limited number of Diffusing nodes

Autor: Marc-Antoine Weisser, Cédric Bentz, Dimitri Watel, Dominique Barth

Publikováno v: Information Processing Letters
Information Processing Letters, Elsevier, 2015, 115 (2), pp.275-279. ⟨10.1016/j.ipl.2014.09.027⟩

Given a directed graph with n nodes, a root r, a set X of k nodes called terminals and non-negative weights ω over the arcs, the Directed Steiner Tree problem (DST) asks for a directed tree T * of minimum cost ω ( T * ) rooted at r and spanning X.I

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c3a091584e9e609eb7b11cfaf3a8c8e1
https://doi.org/10.1016/j.ipl.2014.09.027

On the edge capacitated Steiner tree problem

Autor: Marie-Christine Costa, Cédric Bentz, Alain Hertz

Publikováno v: Discrete Optimization
Discrete Optimization, Elsevier, 2020, 38, pp.100607. ⟨10.1016/j.disopt.2020.100607⟩

Given a graph G = ( V , E ) with a root r ∈ V , positive capacities { c ( e ) | e ∈ E } , and non-negative lengths { l ( e ) | e ∈ E } , the minimum-length (rooted) edge capacitated Steiner tree problem is to find a tree in G of minimum total l

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f8945c40ba1b2d017d5dd8e7013c2b06
https://hal.archives-ouvertes.fr/hal-01465403