Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
type: Item
instance of: scholarly article
title: Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
zbMATH Open document ID: 0967.90017
DOI: 10.1016/S0377-2217(99)00170-8
author: Anita Amberg
author: Wolfgang Domschke
author: Stefan Voß
published in: European Journal of Operational Research
publication date: 2000-08-27T00:00:00Z
Mathematics Subject Classification ID: 90B20
Mathematics Subject Classification ID: 90B40
zbMATH DE Number: 1496135
zbMATH Keywords: arc-routing
zbMATH Keywords: capacited minimum spanning tree problem
zbMATH Keywords: tabu search
MaRDI profile type: Publication
cites work: Q3994799
cites work: Q5687196
cites work: Q5323400
cites work: A parallel insert method for the capacitated arc routing problem
cites work: A note on two problems in connexion with graphs
cites work: Matching, Euler tours and the Chinese postman
cites work: Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Capacitated arc routing problems
cites work: A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
cites work: The capacitated minimal spanning tree problem: An experiment with a hop-indexed model
cites work: Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem
cites work: A Tabu Search Heuristic for the Capacitated arc Routing Problem
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: Q5519709
cites work: Q4085470
cites work: On the complexity of edge traversing
cites work: The complexity of the capacitated tree problem
cites work: Approximate solutions for the capacitated arc routing problem
cites work: Augment-insert algorithms for the capacitated arc routing problem
cites work: A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
Wikidata QID: Q127526486
Recommended article: A deterministic tabu search algorithm for the capacitated arc routing problem
Recommended article: Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
Recommended article: An Approximation Algorithm for the Capacitated Arc Routing Problem
Recommended article: Q4424327
Recommended article: Q5271456
Recommended article: Approximate solutions for the capacitated arc routing problem
Recommended article: Q4350080
Recommended article: Q5323400
Recommended article: An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
description: scientific article; zbMATH DE number 1496135