The capacitated m two node survivable star problem

DOI10.2298/YJOR151115015BzbMath1474.90079MaRDI QIDQ4987700

Franco Robledo, Antonio Mauttone, Gabriel Bayá

Publication date: 3 May 2021

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

zbMATH Keywords

metaheuristicssurvivabilitygreedy randomized adaptive search procedure (GRASP)variable neighborhood search (VNS)topological network design

Mathematics Subject Classification ID

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

Uses Software

• TSPLIB

Cites Work

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

This page was built for publication: The capacitated m two node survivable star problem