An improved heuristic algorithm for the maximum benefit Chinese postman problem

DOI10.1051/ro/2022044zbMath1493.90239OpenAlexW4293255025MaRDI QIDQ5092514

Kenjiro Takazawa, Shiori Matsuura

Publication date: 22 July 2022

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2022044

zbMATH Keywords

combinatorial optimizationspanning treeheuristic algorithm\(T\)-joinmaximum benefit Chinese postman problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: An improved heuristic algorithm for the maximum benefit Chinese postman problem