Pages that link to "Item:Q1121808"
From MaRDI portal
The following pages link to Approximate solutions for the capacitated arc routing problem (Q1121808):
Displaying 38 items.
- An approach to the asymmetric multi-depot capacitated arc routing problem (Q319291) (← links)
- The mixed capacitated arc routing problem with non-overlapping routes (Q319378) (← links)
- Improved bounds for large scale capacitated arc routing problem (Q336459) (← links)
- 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 parallel insert method for the capacitated arc routing problem (Q794931) (← links)
- An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems (Q841604) (← links)
- A deterministic tabu search algorithm for the capacitated arc routing problem (Q941537) (← links)
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities (Q953311) (← links)
- An improved heuristic for the capacitated arc routing problem (Q1010273) (← links)
- Exploiting sparsity in pricing routines for the capacitated arc routing problem (Q1013413) (← links)
- The fleet size and mix problem for capacitated arc routing (Q1064973) (← 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)
- Capacitated arc routing problem with deadheading demands (Q1761173) (← links)
- Constant-factor approximations for capacitated arc routing without triangle inequality (Q1785236) (← links)
- A cutting plane algorithm for the capacitated arc routing problem (Q1870825) (← links)
- A guided local search heuristic for the capacitated arc routing problem (Q1873009) (← 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)
- The min-max close-enough arc routing problem (Q2116901) (← 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)
- The capacitated arc routing problem with refill points (Q2643817) (← links)
- A heuristic method for the capacitated arc routing problem with refill points and multiple loads (Q3585716) (← 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)
- (Q4762465) (← links)
- An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand (Q5301129) (← links)
- Efficient algorithms under dynamic graphs to solve the Capacitated Arc Routing Problem with feasible sparse graph (Q5380984) (← links)
- Approximate solutions for the maximum benefit chinese postman problem (Q5426612) (← links)
- Improving robustness of solutions to arc routing problems (Q5464426) (← links)
- New large-scale data instances for CARP and new variations of CARP (Q5882245) (← links)
- Effects of update frequencies in a dynamic capacitated arc routing problem (Q6092644) (← links)