Chinese postman problem

Definition
Given a directed or underected graph. You are to find a minimum length closed walk that traverses each edge at least once.