Energy-aware survivable networks

DOI10.1016/j.endm.2016.03.018zbMath1351.90034OpenAlexW2398433464MaRDI QIDQ325416

Giuliana Carello, Bernardetta Addis, Sara Mattia

Publication date: 18 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.03.018

zbMATH Keywords

branch-and-cut algorithmenergy aware networkingshared protection

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)

Related Items (1)

Benders Decomposition for Capacitated Network Design

Cites Work

• Solving survivable two-layer network design problems by metric inequalities
• Separating tight metric inequalities by bilevel programming
• Metric inequalities and the network loading problem
• Using mixed-integer programming to solve power grid blackout problems
• Complexity of column generation in network design with path-based survivability mechanisms
• SRG-Disjoint Design with Dedicated and Shared Protection
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• Design of Survivable Networks: A survey

This page was built for publication: Energy-aware survivable networks