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

DOI10.1007/S10878-019-00418-WMaRDI QIDQ2051906zbMATH OpenOpenAlexFDO

Authors Xiaodong Hu, Zhongzheng Tang, Ying Zhang, Xujin Chen, X.-H. Jia, Chenhao Wang

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)

Recommendations

• Algorithms for the ring star problem
• Heuristic algorithms for the multi-depot ring-star problem
• The Capacitated m-Ring-Star Problem
• The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
• An exact algorithm for solving the ring star problem

Cites work

• scientific article; zbMATH DE number 1500530 (Why is no real title available?)
• scientific article; zbMATH DE number 1839431 (Why is no real title available?)
• scientific article; zbMATH DE number 1405785 (Why is no real title available?)
• A Dynamic Programming Approach to Sequencing Problems
• A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
• A method for solving traveling-salesman problems
• A simpler and better derandomization of an approximation algorithm for single source rent-or-buy
• Algorithms for the ring star problem
• An Efficient Heuristic for the Ring Star Problem
• An efficient evolutionary algorithm for the ring star problem
• An improved LP-based approximation for Steiner tree
• Combinatorial optimization. Theory and algorithms.
• Connected facility location via random facility sampling and core detouring
• Heuristic algorithms for the multi-depot ring-star problem
• MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem
• Metaheuristics and cooperative approaches for the bi-objective ring star problem
• Optimizing a ring-based private line telecommunication network using tabu search
• Primal-dual algorithms for connected facility location problems
• Simpler and better approximation algorithms for network design
• TSPLIB—A Traveling Salesman Problem Library
• The Capacitated m-Ring-Star Problem
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• The median tour and maximal covering tour problems: Formulations and heuristics
• The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
• The vehicle routing-allocation problem: A unifying framework
• Tighter Bounds for Graph Steiner Tree Approximation
• Variable neighborhood tabu search and its application to the median cycle problem.
• When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks

Cited in

(2)

• A survivable variant of the ring star problem
• Algorithms for the ring star problem

Describes a project that uses

Uses Software

• MEALS
• TSPLIB

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

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