Robust capacitated Steiner trees and networks with uniform demands

DOI10.1002/net.22143zbMath1529.90061arXiv1801.04696OpenAlexW4323047291MaRDI QIDQ6179720

Cédric Bentz, Thomas Ridremont, Marie-Christine Costa, Pierre-Louis Poirion

Publication date: 18 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1801.04696

zbMATH Keywords

complexity mathematical programming discrete optimization network design Steiner trees robust networks interdiction problems bilevel programs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Survivable networks, linear programming relaxations and the parsimonious property
Optimizing wind farm cable routing considering power losses
Min-max and min-max regret versions of combinatorial optimization problems: A survey
Finding minimum cost directed trees with demands and capacities
The Steiner tree problem
A polyhedral approach to multicommodity survivable network design
Multicriteria optimization
Foundations of bilevel programming
Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem
Deterministic network interdiction
Combinatorial optimization. Polyhedra and efficiency (3 volumes)
Steiner \(k\)-edge connected subgraph polyhedra
On the edge capacitated Steiner tree problem
A survey of network interdiction models and algorithms
Designing networks with resiliency to edge failures using two-stage robust optimization
The Price of Robustness
The complexity of the capacitated tree problem
Finding the n Most Vital Links in Flow Networks
Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs
A directed cycle-based column-and-cut generation method for capacitated survivable network design
Solving Steiner tree problems in graphs to optimality
Robust and Adaptive Network Flows
A catalog of steiner tree formulations
Design of Survivable Networks: A survey
Strong inequalities for capacitated survivable network design problems.
Optimizing the Design of a Wind Farm Collection Network
A survey on mixed-integer programming techniques in bilevel optimization

This page was built for publication: Robust capacitated Steiner trees and networks with uniform demands