Pages that link to "Item:Q3635191"
From MaRDI portal
The following pages link to On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation (Q3635191):
Displaying 21 items.
- New results for the directed profitable rural postman problem (Q296876) (← links)
- Reoptimizing the rural postman problem (Q502442) (← links)
- Undirected postman problems with zigzagging option: a cutting-plane approach (Q925846) (← links)
- Solving the prize-collecting rural postman problem (Q1041930) (← links)
- A polyhedral approach to the rural postman problem (Q1342042) (← links)
- A branch-and-cut algorithm for the undirected rural postman problem (Q1575070) (← links)
- The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm (Q1752763) (← links)
- A heuristic for the periodic rural postman problem (Q1885936) (← links)
- A new view on rural postman based on Eulerian extension and matching (Q1932348) (← links)
- On \((1+\varepsilon)\)-approximate data reduction for the Rural Postman problem (Q2181766) (← links)
- Multi-depot rural postman problems (Q2408522) (← 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)
- A partitioning column approach for solving LED sorter manipulator path planning problems (Q2673413) (← links)
- On crossings, the crossing postman problem, and the rural postman problem (Q2766099) (← links)
- Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
- A Generalized Traveling Salesman Problem Approach to the Directed Clustered Rural Postman Problem (Q4355335) (← links)
- On approximate data reduction for the Rural Postman Problem: Theory and experiments (Q6092640) (← links)
- Improving a constructive heuristic for the general routing problem (Q6179705) (← links)
- Theoretical and computational analysis of a new formulation for the rural postman problem and the general routing problem (Q6551080) (← links)
