Algorithms for the metric ring star problem with fixed edge-cost ratio

DOI10.1007/s10878-019-00418-wzbMath1481.90304OpenAlexW2944885181MaRDI QIDQ2051906

Xiao-Dong Hu, Ying Zhang, Zhongzheng Tang, Xiao-Hua Jia, Chen-Hao Wang, Xu-jin Chen

Publication date: 25 November 2021

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-019-00418-w

zbMATH Keywords

heuristicslocal searchapproximation algorithmsconnected facility locationring star

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

A survivable variant of the ring star problem

Uses Software

• TSPLIB
• MEALS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem
• The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
• Heuristic algorithms for the multi-depot ring-star problem
• The median tour and maximal covering tour problems: Formulations and heuristics
• Variable neighborhood tabu search and its application to the median cycle problem.
• Algorithms for the ring star problem
• The vehicle routing-allocation problem: A unifying framework
• Primal-dual algorithms for connected facility location problems
• Connected facility location via random facility sampling and core detouring
• An efficient evolutionary algorithm for the ring star problem
• A simpler and better derandomization of an approximation algorithm for single source rent-or-buy
• Metaheuristics and cooperative approaches for the bi-objective ring star problem
• An improved LP-based approximation for steiner tree
• Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search
• A Dynamic Programming Approach to Sequencing Problems
• The Capacitated m-Ring-Star Problem
• Simpler and better approximation algorithms for network design
• TSPLIB—A Traveling Salesman Problem Library
• A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
• An Efficient Heuristic for the Ring Star Problem
• Tighter Bounds for Graph Steiner Tree Approximation
• A Method for Solving Traveling-Salesman Problems
• A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
• Combinatorial optimization. Theory and algorithms.

This page was built for publication: Algorithms for the metric ring star problem with fixed edge-cost ratio