Pages that link to "Item:Q4658427"
From MaRDI portal
The following pages link to Solving arc routing problems with turn penalties (Q4658427):
Displaying 15 items.
- The capacitated general windy routing problem with turn penalties (Q433125) (← links)
- Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks (Q940859) (← links)
- Bounds on penalties for dummy arcs in transportation networks (Q1117136) (← links)
- Iterated local search and column generation to solve arc-routing as a permutation set-covering problem (Q1752200) (← links)
- Route planning with turn restrictions: A computational experiment (Q1758274) (← 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)
- Solution of real-world postman problems (Q2482818) (← links)
- Linear programming and Lagrangian relaxation heuristics for designing a material flow network on a block layout (Q3055322) (← links)
- Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
- Modeling and Solving the Intersection Inspection Rural Postman Problem (Q5085490) (← links)
- Node, Edge, Arc Routing and Turn Penalties: Multiple Problems—One Neighborhood Extension (Q5360839) (← links)
- A transformation for the mixed general routing problem with turn penalties (Q5387391) (← 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)
