Erratum to: ``Approximating the length of Chinese postman tours

DOI10.1007/S10288-017-0346-2zbMATH Open1471.90023OpenAlexW2619595592MaRDI QIDQ1680766FDOQ1680766

Authors: Nathalie Bostel, Philippe Castagliola, P. Dejax, André Langevin 

Publication date: 16 November 2017

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: http://link.springer.com/10.1007/s10288-017-0346-2

Recommendations

• Approximating the length of Chinese postman tours
• Covering the edges of a graph by circuits
• Arc Routing Problems, Part I: The Chinese Postman Problem
• Improved solutions for the Chinese postman problem on mixed networks
• Chinese postman problem over 50 years

zbMATH Keywords

transportstatisticslogisticsvehicle routing

Mathematics Subject Classification ID

General nonlinear regression (62J02) Transportation, logistics and supply chain management (90B06)

Cites Work

• Approximating the length of Chinese postman tours

Cited In (1)

• Approximating the length of Chinese postman tours

This page was built for publication: Erratum to: ``Approximating the length of Chinese postman tours

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