Time-constrained Chinese postman problems
type: Item
instance of: scholarly article
title: Time-constrained Chinese postman problems
zbMATH Open document ID: 1067.90146
DOI: 10.1016/S0898-1221(02)00156-6
author: Hsiao-Fan Wang
author: Yu-Pin Wen
publication date: 2004-11-18T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 2116474
zbMATH Keywords: Chinese postman problem
zbMATH Keywords: Crisp and fuzzy time window constraints
MaRDI profile type: Publication
cites work: Networks and vehicle routing for municipal waste collection
cites work: Matching, Euler tours and the Chinese postman
cites work: Q3822103
cites work: Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
cites work: A fundamental problem in vehicle routing
cites work: Q4004084
cites work: Q4163244
cites work: Arc Routing Problems, Part I: The Chinese Postman Problem
cites work: A new algorithm for the directed Chinese postman problem
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 2116474