From HandWiki - Reading time: 3 min
This is a list of different problems in graph theory.
| Problem | Abbreviation | Description | Output Notes | Examples |
|---|---|---|---|---|
| Arc Routing Problem | ARP | Determine a least-cost traversal of a specified arc subset of a graph, with or without constraints.[1] | Seven Bridges of Konigsberg | |
| Chinese Postman Problem | CPP | undirected graph G with Vertices V and weighted edges E | Traverse every edge at least once with minimal cost | "A mailman has to cover his assigned segment before returning to the post office. The problem is to find the shortest walking distance for the mailman."[2] |
| Rural Postman Problem | RPP | undirected graph G with Vertices V and weighted edges E | Traverse a subset of the edges E at least once with minimum cost | |
| Directed Rural Postman Problem | DRPP | |||
| Rural Postman Problem with Turn Penalties | RPP-TP, RPPTP | |||
| Windy Postman Problem | WPP[3] | |||
| Windy Rural Postman Problem | WRPP | |||
| Street Sweeper Problem | SPP | |||
| m-Plowing Problem | m-PP | |||
| Capacitated Plow Problem | C-PP | |||
| Downhill Plow Problem | DPP[4] | |||
| Downhill Plow Problem with Turn Penalties | DPP-TP[5][6] | |||
| Rural Downhill Plow Problem with Turn Penalties | RDPP-TP | |||
| Capacitated Arc Routing Problem | CARP | |||
| k-Plow Windy Rural Postman Problem | k-WRPP | |||
| Min-Max Downhill Plow Problem with Multiple Plows | MM k-DPP | |||
| Min-Max Windy Rural Postman Problem | MM k-WRPP | |||
| Plowing with Precedence Problem | PPP | |||
| Min-Max Extended Downhill Plow Problem | MM k-DPPE | |||
| Capacitated Chinese Postman Problem | CCPP | |||
| Directed Chinese Postman Problem | DCPP | |||
| Directed Rural Postman Problem | DRPP | |||
| Extended Capacitated Arc Routing Problem | ECARP | |||
| Hierarchical Chinese Postman Problem | HCPP | |||
| Mixed Capacitated Arc Routing Problem | MCARP | |||
| Mixed Chinese Postman Problem | MCPP | |||
| Stacker Crane Problem | SCP | Certain arcs must be traversed at least once in one direction but can be traversed as many times in the other direction | ||
| Traveling Salesman Problem | TSP | |||
| Undirected Capacitated Arc Routing Problem | UCARP | |||
| Undirected Rural Postman Problem | URPP | |||
| Vehicle Routing Problem | VRP | |||
| Min-Max Multiple-Depot Rural Postman Problem | MMMDRPP[7] | |||
| Generalized Vehicle Routing Problem | GVRP[8] |