[AM11-6] Other classic network problems

Classic network problems are examples of networking problems such as the Traveling Salesman Problem and the Chinese Postman Problem that need graph algorithms to be solved.

External resources

• Jungnickel, D. (2008). Graphs, networks and algorithms. Berlin: Springer. 978-3-540-72780-4

Learning outcomes

• 44 - List several classic problems to which network analysis is applied e.g., The Traveling Salesman Problem, The Chinese Postman Problem
  List several classic problems to which network analysis is applied e.g., The Traveling Salesman Problem, The Chinese Postman Problem
• 45 - Explain why heuristic solutions are generally used to address the combinatorially complex nature of these problems and the difficulty of solving them optimally
  Explain why heuristic solutions are generally used to address the combinatorially complex nature of these problems and the difficulty of solving them optimally

Self assessment

Outgoing relations

• [AM11-6] Other classic network problems subclassof [AM11] Network analysis