Pages that link to "Item:Q1121808"
From MaRDI portal
The following pages link to Approximate solutions for the capacitated arc routing problem (Q1121808):
Displaying 16 items.
- GRASP with evolutionary path-relinking for the capacitated arc routing problem (Q336740) (← links)
- Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities (Q342292) (← links)
- The open capacitated arc routing problem (Q716347) (← links)
- A deterministic tabu search algorithm for the capacitated arc routing problem (Q941537) (← links)
- An improved heuristic for the capacitated arc routing problem (Q1010273) (← links)
- Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees (Q1577774) (← links)
- An efficiency-based path-scanning heuristic for the capacitated arc routing problem (Q1634089) (← links)
- Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics (Q1730649) (← links)
- A cutting plane algorithm for the capacitated arc routing problem (Q1870825) (← links)
- A capacitated general routing problem on mixed networks (Q1894722) (← links)
- Algorithms for the Chinese postman problem on mixed networks (Q1894723) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Augment-insert algorithms for the capacitated arc routing problem (Q2276892) (← links)
- Solving capacitated arc routing problems using a transformation to the CVRP (Q2581620) (← links)
- New lower bounds for the Capacitated Arc Routing Problem (Q3802908) (← links)
- Approximate solutions for the maximum benefit chinese postman problem (Q5426612) (← links)
