Pages that link to "Item:Q1342042"
From MaRDI portal
The following pages link to A polyhedral approach to the rural postman problem (Q1342042):
Displayed 17 items.
- Lower bounds and heuristics for the windy rural postman problem (Q852946) (← links)
- Undirected postman problems with zigzagging option: a cutting-plane approach (Q925846) (← links)
- New inequalities for the general routing problem (Q1278493) (← links)
- The rural postman problem with deadline classes (Q1291753) (← links)
- The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra (Q1296789) (← links)
- A heuristic algorithm based on Monte Carlo methods for the rural postman problem. (Q1406725) (← links)
- Solving the hierarchical Chinese postman problem as a rural postman problem. (Q1428044) (← links)
- The general routing polyhedron: A unifying framework (Q1806888) (← links)
- A heuristic for the periodic rural postman problem (Q1885936) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- On the general routing polytope (Q2473035) (← links)
- Computing finest mincut partitions of a graph and application to routing problems (Q2473036) (← links)
- A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem (Q2496041) (← links)
- A constructive heuristic for the undirected rural postman problem (Q2496045) (← links)
- The capacitated arc routing problem with intermediate facilities (Q2719845) (← links)
- Heuristics for single-pass welding task sequencing (Q4710091) (← links)
- (Q4934874) (← links)