A Note on K-Best Solutions to the Chinese Postman Problem

DOI10.1137/0803037zbMath0806.90105MaRDI QIDQ4277509

Tomomi Matsui, Yasufumi Saruwatari

Publication date: 19 February 1995

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0803037

zbMATH Keywords

time complexity; Chinese postman; non-bipartite matching; \(K\)-best solutions

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C60: Abstract computational complexity for mathematical programming problems

90C27: Combinatorial optimization

05C38: Paths and cycles

05C45: Eulerian and Hamiltonian graphs