A heuristic algorithm based on Monte Carlo methods for the rural postman problem.
type: Item
instance of: scholarly article
title: A heuristic algorithm based on Monte Carlo methods for the rural postman problem.
zbMATH Open document ID: 1040.90553
DOI: 10.1016/S0305-0548(98)00028-8
published in: Computers \& Operations Research
publication date: 2003-09-07T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1975825
zbMATH Keywords: Rural Postman Problem
zbMATH Keywords: routing problems
zbMATH Keywords: Monte Carlo methods
author: Pedro Fernández de Córdoba
author: Lluís Miquel García Raffi
author: José M. Sanchis
MaRDI profile type: Publication
cites work: Q5687196
cites work: Arc Routing Problems, Part II: The Rural Postman Problem
cites work: Matching, Euler tours and the Chinese postman
cites work: A fundamental problem in vehicle routing
cites work: On general routing problems
cites work: Approximation Algorithms for Some Postman Problems
cites work: Algorithms for the rural postman problem
cites work: A polyhedral approach to the rural postman problem
cites work: New inequalities for the general routing problem
full work available at URL: s0305-0548(98)00028-8
OpenAlex ID: W1969087251
description: scientific article; zbMATH DE number 1975825