Algorithms for the metric ring star problem with fixed edge-cost ratio
type: Item
instance of: scholarly article
title: Algorithms for the metric ring star problem with fixed edge-cost ratio
zbMATH Open document ID: 1481.90304
author: Xiaodong Hu
author: Zhongzheng Tang
author: Ying Zhang
author: Xujin Chen
author: X.-H. Jia
author: Chenhao Wang
published in: Journal of Combinatorial Optimization
publication date: 2021-11-25T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7433399
zbMATH Keywords: ring star
zbMATH Keywords: approximation algorithms
zbMATH Keywords: heuristics
zbMATH Keywords: local search
zbMATH Keywords: connected facility location
describes a project that uses: TSPLIB
describes a project that uses: MEALS
MaRDI profile type: Publication
full work available at URL: s10878-019-00418-w
OpenAlex ID: W2944885181
cites work: When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
cites work: Heuristic algorithms for the multi-depot ring-star problem
cites work: The Capacitated m-Ring-Star Problem
cites work: The vehicle routing-allocation problem: A unifying framework
cites work: Combinatorial optimization. Theory and algorithms.
cites work: An improved LP-based approximation for Steiner tree
cites work: An efficient evolutionary algorithm for the ring star problem
cites work: MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem
cites work: Algorithms for the ring star problem
cites work: A Method for Solving Traveling-Salesman Problems
cites work: The median tour and maximal covering tour problems: Formulations and heuristics
cites work: An Efficient Heuristic for the Ring Star Problem
cites work: Connected facility location via random facility sampling and core detouring
cites work: A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees
cites work: Simpler and better approximation algorithms for network design
cites work: A Dynamic Programming Approach to Sequencing Problems
cites work: Q4501548
cites work: A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
cites work: The Ring Star Problem: Polyhedral analysis and exact algorithm
cites work: Metaheuristics and cooperative approaches for the bi-objective ring star problem
cites work: Variable neighborhood tabu search and its application to the median cycle problem.
cites work: Q4938770
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: Tighter Bounds for Graph Steiner Tree Approximation
cites work: The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
cites work: Primal-dual algorithms for connected facility location problems
cites work: Q4782696
cites work: A simpler and better derandomization of an approximation algorithm for single source rent-or-buy
cites work: Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search
DOI: 10.1007/S10878-019-00418-W
description: scientific article; zbMATH DE number 7433399