Pages that link to "Item:Q5959378"
From MaRDI portal
The following pages link to The Rural Postman Problem on mixed graphs with turn penalties (Q5959378):
Displaying 17 items.
- Rural postman parameterized by the number of components of required edges (Q314816) (← links)
- The capacitated general windy routing problem with turn penalties (Q433125) (← links)
- The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm (Q1752763) (← links)
- The directed profitable rural postman problem with incompatibility constraints (Q1753601) (← links)
- Heuristic method for a mixed capacitated arc routing problem: A refuse collection application (Q1887872) (← links)
- Heuristics for the mixed rural postman problem (Q1968592) (← links)
- A two-stage solution approach for the directed rural postman problem with turn penalties (Q1991193) (← links)
- A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)
- Solving an urban waste collection problem using ants heuristics (Q2475858) (← links)
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation (Q2482754) (← links)
- Solution of real-world postman problems (Q2482818) (← links)
- Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
- The Directed Rural Postman Problem with Turn Penalties (Q4950871) (← links)
- Modeling and Solving the Intersection Inspection Rural Postman Problem (Q5085490) (← links)
- Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem (Q5881498) (← links)
- A branch‐and‐dive heuristic for single vehicle snow removal (Q6092642) (← links)
- Solving the large-scale min-max \(k\)-rural postman problem for snow plowing (Q6496352) (← links)