The following pages link to (Q5271456):
Displaying 21 items.
- The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem (Q296774) (← links)
- The mixed capacitated arc routing problem with non-overlapping routes (Q319378) (← links)
- A parallel insert method for the capacitated arc routing problem (Q794931) (← links)
- A deterministic tabu search algorithm for the capacitated arc routing problem (Q941537) (← links)
- The capacitated arc routing problem: Valid inequalities and facets (Q1384095) (← 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)
- The min-max close-enough arc routing problem (Q2116901) (← links)
- The arc-item-load and related formulations for the cumulative vehicle routing problem (Q2172084) (← links)
- Exact solution of the soft-clustered vehicle-routing problem (Q2272311) (← links)
- The commodity-split multi-compartment capacitated arc routing problem (Q2664322) (← links)
- Large multiple neighborhood search for the soft-clustered vehicle-routing problem (Q2668597) (← links)
- New lower bounds for the Capacitated Arc Routing Problem (Q3802908) (← links)
- A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem (Q4411206) (← links)
- The rescheduling arc routing problem (Q4601630) (← links)
- (Q4668751) (← links)
- Arc routing problems: A review of the past, present, and future (Q6087068) (← links)
- Effects of update frequencies in a dynamic capacitated arc routing problem (Q6092644) (← links)
- Fast upper and lower bounds for a large‐scale real‐world arc routing problem (Q6179706) (← links)
- An updated annotated bibliography on arc routing problems (Q6496350) (← links)