The Capacitated Canadian Postman Problem

DOI10.1080/03155986.1989.11732082MaRDI QIDQ3826377zbMATH OpenOpenAlexFDO

Authors Serge Roy, Jean-Marc Rousseau

Publication date 1989

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03155986.1989.11732082

zbMATH Keywords

Arc routingcapacitated Chinese postman problemheuristicmerging cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Numerical mathematical programming methods (65K05) Graph theory (including graph drawing) in computer science (68R10) Programming involving graphs or networks (90C35)

Recommendations

• Arc Routing Problems, Part I: The Chinese Postman Problem
• Publication:4944300
• scientific article; zbMATH DE number 764424
• scientific article; zbMATH DE number 1568943
• scientific article; zbMATH DE number 4068590

Cited in

(12)

• Optimizing solid waste collection in Brussels
• ARC: A computerized system for urban garbage collection
• Routing problems: A bibliography
• Augment-insert algorithms for the capacitated arc routing problem
• Solving an urban waste collection problem using ants heuristics
• The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
• scientific article; zbMATH DE number 4068590 (Why is no real title available?)
• The capacitated general windy routing problem with turn penalties
• scientific article; zbMATH DE number 764424 (Why is no real title available?)
• scientific article; zbMATH DE number 1418032 (Why is no real title available?)
• The Rural Postman Problem on mixed graphs with turn penalties
• Solving the large-scale min-max k-rural postman problem for snow plowing

This page was built for publication: The Capacitated Canadian Postman Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3826377)