The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
type: Item
instance of: scholarly article
title: The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
zbMATH Open document ID: 0623.90083
DOI: 10.1080/01966324.1987.10737208
author: Arjang A. Assad
author: Wen Lea Pearn
author: Bruce Golden
published in: American Journal of Mathematical and Management Sciences
publication date: 1987-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 4012344
zbMATH Keywords: vehicle routing
zbMATH Keywords: Capacitated Chinese Postman Problem
zbMATH Keywords: NP-hard
zbMATH Keywords: matching- based lower bound
Wikidata QID: Q58116978
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1080/01966324.1987.10737208
OpenAlex ID: W2021646400
cites work: Networks and vehicle routing for municipal waste collection
cites work: A parallel insert method for the capacitated arc routing problem
cites work: Matching, Euler tours and the Chinese postman
cites work: Capacitated arc routing problems
description: scientific article