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

06/15/2018
by   Cédric Bentz, et al.
0

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 terminals and an integer k, we search for a minimum cost subset E ⊂ E, covering T and r, such that the network induced by E is k-survivable: after the removal of any k edges, there still exists a feasible flow from r to T. We also consider the possibility of protecting a given number of edges. We propose three different formulations: a cut-set, a flow and a bi-level formulation where the second-level is a min-max problem (with an attacker and a defender). We propose algorithms for each problem formulation and compare their efficiency.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/15/2018

Robust capacitated trees and networks with uniform demands

We are interested in the design of robust (or resilient) capacitated roo...
research
07/17/2020

Solving hard cut problems via flow-augmentation

We present a new technique for designing FPT algorithms for graph cut pr...
research
12/16/2021

Min-cost-flow preserving bijection between subgraphs and orientations

Consider an undirected graph G=(V,E). A subgraph of G is a subset of its...
research
07/09/2021

A Tight Max-Flow Min-Cut Duality Theorem for Non-Linear Multicommodity Flows

The Max-Flow Min-Cut theorem is the classical duality result for the Max...
research
04/19/2021

New formulations and branch-and-cut procedures for the longest induced path problem

Given an undirected graph G=(V,E), the longest induced path problem (LIP...
research
02/17/2020

An Experimental Study of ILP Formulations for the Longest Induced Path Problem

Given a graph G=(V,E), the longest induced path problem asks for a maxim...
research
08/08/2017

Power packet transferability via symbol propagation matrix

Power packet is a unit of electric power transferred by a power pulse wi...

Please sign up or login with your details

Forgot password? Click here to reset