Chinese postman problem

Related lectures (9)

Explores Eulerian circuits through the Königsberg bridges problem, leading to the development of graph theory and topology.

Explores a classic handshake problem at a party using graph representation.

Explores the Traveling Salesman Problem, resolution algorithms, minimum spanning tree, and shortcut optimization.

Covers Lagrangian duality in optimization, focusing on the minimum bin path problem and path time optimization.

Covers finding the shortest path in directed graphs efficiently using algorithmic approaches and discussing related NP-complete problems.

Covers the basics of algorithms, problem-solving, and efficient resolution methods.

Explains the process of finding an initial Basic Feasible Solution for linear optimization problems using the Simplex Algorithm.

Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.

Covers the traveling salesman problem, modeling, constraints, additional constraints, and network representation.

Page 1 of 1