Modeling and solving several classes of arc routing problems as traveling salesman problems
type: Item
instance of: scholarly article
title: Modeling and solving several classes of arc routing problems as traveling salesman problems
zbMATH Open document ID: 0889.90146
DOI: 10.1016/S0305-0548(97)00013-0
author: G. Laporte
published in: Computers \& Operations Research
publication date: 1997-12-02T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1092821
zbMATH Keywords: arc routing
zbMATH Keywords: traveling salesman
zbMATH Keywords: low density graphs
zbMATH Keywords: Mixed Rural Postman Problems
zbMATH Keywords: Stacker Crane Problems
MaRDI profile type: Publication
cites work: Arc Routing Problems, Part I: The Chinese Postman Problem
cites work: Arc Routing Problems, Part II: The Rural Postman Problem
cites work: Q5687196
cites work: Capacitated arc routing problems
cites work: Matching, Euler tours and the Chinese postman
cites work: An Efficient Transformation Of The Generalized Traveling Salesman Problem
cites work: Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
cites work: A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
cites work: An optimal algorithm for the mixed Chinese postman problem
cites work: An algorithm for the Rural Postman problem on a directed graph
description: scientific article; zbMATH DE number 1092821