Heuristic algorithms for the multi-depot ring-star problem
type: Item
instance of: scholarly article
title: Heuristic algorithms for the multi-depot ring-star problem
zbMATH Open document ID: 1176.90086
published in: European Journal of Operational Research
publication date: 2009-12-07T00:00:00Z
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5643720
zbMATH Keywords: optical network design
zbMATH Keywords: heuristics
zbMATH Keywords: tabu search
author: Roberto Baldacci
author: Mauro Dell'Amico
describes a project that uses: TSPLIB
describes a project that uses: Tabu search
MaRDI profile type: Publication
Wikidata QID: Q59222258
full work available at URL: j.ejor.2009.07.026
OpenAlex ID: W1981242636
cites work: The Capacitated m-Ring-Star Problem
cites work: The vehicle routing-allocation problem: A unifying framework
cites work: Assignment Problems
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem
cites work: Q4354785
cites work: Q4955272
cites work: The Ring Star Problem: Polyhedral analysis and exact algorithm
cites work: Locating median cycles in networks
cites work: Q4532227
cites work: Computer Solutions of the Traveling Salesman Problem
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search
DBLP publication ID: journals/eor/BaldacciD10
DOI: 10.1016/J.EJOR.2009.07.026
description: scientific article; zbMATH DE number 5643720