Thomas Ridremont

collaborators

3 papers

cs.DS2018

Formulations for designing robust networks. An application to wind power collection

Cédric Bentz, Marie-Christine Costa, Pierre-Louis Poirion +1

We are interested in the design of survivable capacitated rooted Steiner networks. Given a graph G = (V, E), capacity and cost functions on E, a root r, a subset T of V of terminal…

math.OC2018

Robust capacitated trees and networks with uniform demands

Cédric Bentz, Marie-Christine Costa, Pierre-Louis Poirion +1

We are interested in the design of robust (or resilient) capacitated rooted Steiner networks in case of terminals with uniform demands. Formally, we are given a graph, capacity and…

math.CO2017

Adaptive Network Flow with $k$ -Arc Destruction

Thomas Ridremont, Dimitri Watel, Pierre-Louis Poirion +1

When a flow is not allowed to be reoriented the Maximum Residual Flow Problem with $k$ -Arc Destruction is known to be $N P$ -hard for $k = 2$ . We show that when a flow is allowed to be…

Formulations for designing robust networks. An application to wind power collection

Robust capacitated trees and networks with uniform demands

Adaptive Network Flow with k-Arc Destruction

Adaptive Network Flow with $k$ -Arc Destruction