The capacitated m two node survivable star problem

DOI10.2298/YJOR151115015BMaRDI QIDQ4987700zbMATH OpenFDO

Authors Gabriel Bayá, Antonio Mauttone, Franco Robledo

Publication date 3 May 2021

Published in Yugoslav Journal of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2298/YJOR151115015B

zbMATH Keywords

greedy randomized adaptive search procedure (GRASP)metaheuristicssurvivabilitytopological network designvariable neighborhood search (VNS)

Mathematics Subject Classification ID

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

Recommendations

• 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
• Survivable network design: the capacitated minimum spanning network problem

Cites work

• A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem
• A heuristic procedure for the capacitated m-ring-star problem
• An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
• Approximation Algorithms for Several Graph Augmentation Problems
• Design of survivable networks
• Greedy randomized adaptive search procedures
• Locating median cycles in networks
• Minimum-weight two-connected spanning networks
• Optimal location of a path or tree on a network with cycles
• Solution of a Large-Scale Traveling-Salesman Problem
• The Capacitated m-Ring-Star Problem
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• Variable neighborhood search

Cited in

(2)

• Capacitated m two-node survivable star problem
• Two-node-connected star problem

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: The 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 Q4987700)