Improved solutions for the Chinese postman problem on mixed networks

DOI10.1016/S0305-0548(98)00092-6zbMath0957.90020OpenAlexW2048636140MaRDI QIDQ1304518

J. B. Chou, Wen Lea Pearn

Publication date: 22 September 1999

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(98)00092-6

zbMATH Keywords

combinatorial optimizationnetwork routing

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (4)

Solvable cases of the \(k\)-person Chinese postman problem ⋮ Approximate solutions for the maximum benefit chinese postman problem ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ Uncertain multi-objective Chinese postman problem

This page was built for publication: Improved solutions for the Chinese postman problem on mixed networks