Pages that link to "Item:Q4015406"
From MaRDI portal
The following pages link to NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM (Q4015406):
Displayed 7 items.
- Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics (Q1730649) (← links)
- An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem (Q1761166) (← links)
- Improved lower bounds and exact algorithm for the capacitated arc routing problem (Q1942278) (← links)
- New lower bound for the capacitated arc routing problem (Q2496046) (← links)
- Solving capacitated arc routing problems using a transformation to the CVRP (Q2581620) (← links)
- A Decade of Capacitated Arc Routing (Q3564348) (← links)
- On matchings, <i>T</i>‐joins, and arc routing in road networks (Q6065851) (← links)