Capacitated m two-node survivable star problem

DOI10.1016/J.ENDM.2016.03.034MaRDI QIDQ325452zbMATH OpenOpenAlexFDO

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

Publication date 18 October 2016

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

zbMATH Keywords

network optimizationCmRSPCmTNSSPGRASP

Mathematics Subject Classification ID

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

Recommendations

• The capacitated \(m\) two node survivable star problem
• Two-node-connected star problem
• The Capacitated m-Ring-Star Problem
• An integer linear programming formulation and branch-and-cut algorithm for the capacitated \(m\)-ring-star problem
• A heuristic procedure for the capacitated \(m\)-ring-star problem

Cites work

• scientific article; zbMATH DE number 2050708 (Why is no real title available?)
• A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem
• Minimum-weight two-connected spanning networks
• The Capacitated m-Ring-Star Problem

Cited in

(3)

• The capacitated \(m\) two node survivable star problem
• Two-node-connected star problem
• A survivable variant of the ring star problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q325452)