Open main menu
Route inspection problem 
In graph theory, the Chinese postman problem (CPP) or Route inspection problem, is to find a shortest closed path or circuit that visits every edge of a (connected) undirected graph
Upload media
Wikipedia-logo-v2.svg  Wikipedia
Instance of NP-complete
Authority control
Blue pencil.svg
Problema del cartero chino (es); Problème du postier chinois (fr); Postari txinatarraren ebazkizun (eu); Задача инспекции дорог (ru); Briefträgerproblem (de); Problema da inspeção de rotas (pt); 邮递员问题 (zh); 郵遞員問題 (zh-hk); בעיית הדוור הסיני (he); Problem chińskiego listonosza (pl); Задача листоноші (uk); Chinees postbodeprobleem (nl); 郵遞員問題 (zh-hant); 邮递员问题 (zh-hans); Kínaipostás-probléma (hu); Problema del postino cinese (it); Route inspection problem (en); 中国人郵便配達問題 (ja); Problém čínského listonoše (cs); Bài toán người đưa thư Trung Hoa (vi) In graph theory, the Chinese postman problem (CPP) or Route inspection problem, is to find a shortest closed path or circuit that visits every edge of a (connected) undirected graph (en) Problema del circuito del cartero, Problema de la inspección de rutas, Problema de la selección de rutas, Problema de la inspeccion de rutas, Problema de la seleccion de rutas (es); Chinese Postman Problem (de); Problema do carteiro chinês (pt); Chinese postman problem (en); 中国邮递员问题, 中国油路问题, 中国邮路问题, 中国邮路, 中国邮差问题 (zh); Čínský problém listonoše (cs); Chinese postbodeprobleem (nl)

Media in category "Route inspection problem"

The following 3 files are in this category, out of 3 total.