Pages that link to "Item:Q1575070"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for the undirected rural postman problem (Q1575070):
Displayed 11 items.
- Undirected postman problems with zigzagging option: a cutting-plane approach (Q925846) (← links)
- Solving the prize-collecting rural postman problem (Q1041930) (← links)
- Solving the hierarchical Chinese postman problem as a rural postman problem. (Q1428044) (← links)
- A heuristic for the periodic rural postman problem (Q1885936) (← links)
- On the general routing polytope (Q2473035) (← links)
- Computing finest mincut partitions of a graph and application to routing problems (Q2473036) (← links)
- A note on the undirected rural postman problem polytope (Q2492671) (← links)
- Privatized rural postman problems (Q2496044) (← links)
- A constructive heuristic for the undirected rural postman problem (Q2496045) (← links)
- The capacitated arc routing problem with refill points (Q2643817) (← links)
- The capacitated arc routing problem with intermediate facilities (Q2719845) (← links)