Capacitated \(m\) two-node survivable star problem

DOI10.1016/J.ENDM.2016.03.034zbMath1351.90038OpenAlexW2406000477MaRDI QIDQ325452

Franco Robledo, Pablo Romero, Gabriel Bayá, Antonio Mauttone

Publication date: 18 October 2016

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

zbMATH Keywords

GRASPnetwork optimizationCmRSPCmTNSSP

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Cites Work

• Minimum-weight two-connected spanning networks
• A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem
• The Capacitated m-Ring-Star Problem
• Unnamed Item

This page was built for publication: Capacitated \(m\) two-node survivable star problem