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

DOI10.1137/0803037zbMath0806.90105OpenAlexW1974169387MaRDI QIDQ4277509

Yasufumi Saruwatari, Tomomi Matsui

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 complexityChinese postmannon-bipartite matching\(K\)-best solutions

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

This page was built for publication: A Note on K-Best Solutions to the Chinese Postman Problem