Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Finding postal carrier walk paths in mixed graphs

From MaRDI portal
Publication:1380723
Jump to:navigation, search

DOI10.1023/A:1018350224084zbMath0897.90190MaRDI QIDQ1380723

Hong Yan, Gerald L. Thompson

Publication date: 11 March 1998

Published in: Computational Optimization and Applications (Search for Journal in Brave)


zbMATH Keywords

windy postman problempostman problemedge traversals in graphs


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)


Related Items (1)

Recent results on Arc Routing Problems: An annotated bibliography







This page was built for publication: Finding postal carrier walk paths in mixed graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1380723&oldid=13531043"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 15:25.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki