Graph theory: Route problems
Route inspection problem RIP NP-complete
NIST Chinese Postman Problem CPP, use GOBLIN
Stony Brook Algorithm Repository: Eulerian Cycle / Chinese Postman
Travelling salesman problem TSP NP-hard
GOBLIN Graph Library
Tuesday, January 13, 2015
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment