A GRASP heuristic for the mixed Chinese postman problem
type: Item
instance of: scholarly article
title: A GRASP heuristic for the mixed Chinese postman problem
zbMATH Open document ID: 1081.90604
DOI: 10.1016/S0377-2217(01)00296-X
author: Rafael Martí
author: Ángel Corberán
author: José M. Sanchis
published in: European Journal of Operational Research
publication date: 2002-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1829930
zbMATH Keywords: Metaheuristics
zbMATH Keywords: Routing
zbMATH Keywords: Chinese postman
zbMATH Keywords: GRASP
MaRDI profile type: Publication
cites work: Q5687196
cites work: Q4762468
cites work: Q3337973
cites work: Matching, Euler tours and the Chinese postman
cites work: Q4762467
cites work: Arc Routing Problems, Part I: The Chinese Postman Problem
cites work: Arc Routing Problems, Part II: The Rural Postman Problem
cites work: A probabilistic heuristic for a computationally difficult set covering problem
cites work: Greedy randomized adaptive search procedures
cites work: Q5514188
cites work: Approximation Algorithms for Some Postman Problems
cites work: A cutting plane algorithm for the windy postman problem
cites work: Q5519709
cites work: Q4762470
cites work: A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem
cites work: Q4085470
cites work: An optimal algorithm for the mixed Chinese postman problem
cites work: Odd Minimum Cut-Sets and b-Matchings
cites work: On the complexity of edge traversing
cites work: Q3840356
cites work: Computing approximate solutions of the maximum covering problem with GRASP
full work available at URL: s0377-2217(01)00296-x
OpenAlex ID: W2022037516
description: scientific article; zbMATH DE number 1829930