Approximate solutions for the capacitated arc routing problem
From MaRDI portal
Recommendations
Cites work
Cited in
(46)- Augment-insert algorithms for the capacitated arc routing problem
- Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
- The capacitated arc routing problem. A heuristic algorithm
- An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems
- New large-scale data instances for CARP and new variations of CARP
- The min-max close-enough arc routing problem
- Exploiting sparsity in pricing routines for the capacitated arc routing problem
- Variants of the capacitated arc routing problem
- Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition
- scientific article; zbMATH DE number 1568938 (Why is no real title available?)
- A heuristic method for the capacitated arc routing problem with refill points and multiple loads
- Efficient algorithms under dynamic graphs to solve the capacitated arc routing problem with feasible sparse graph
- Algorithms for the Chinese postman problem on mixed networks
- An efficiency-based path-scanning heuristic for the capacitated arc routing problem
- New lower bounds for the Capacitated Arc Routing Problem
- A decade of capacitated arc routing
- A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
- The capacitated arc routing problem: heuristics
- scientific article; zbMATH DE number 1975105 (Why is no real title available?)
- An approach to the asymmetric multi-depot capacitated arc routing problem
- The mixed capacitated arc routing problem with non-overlapping routes
- Improving robustness of solutions to arc routing problems
- Improved bounds for large scale capacitated arc routing problem
- GRASP with evolutionary path-relinking for the capacitated arc routing problem
- Constant-factor approximations for capacitated arc routing without triangle inequality
- The open capacitated arc routing problem
- Approximate solutions for the maximum benefit chinese postman problem
- Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
- A deterministic tabu search algorithm for the capacitated arc routing problem
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
- A guided local search heuristic for the capacitated arc routing problem
- A capacitated general routing problem on mixed networks
- Routing problems: A bibliography
- The fleet size and mix problem for capacitated arc routing
- An exact algorithm for the capacitated arc routing problem with deadheading demand
- The capacitated arc routing problem: Valid inequalities and facets
- The capacitated arc routing problem: exact algorithms
- Effects of update frequencies in a dynamic capacitated arc routing problem
- An improved heuristic for the capacitated arc routing problem
- A cutting plane algorithm for the capacitated arc routing problem
- An approximation algorithm for the capacitated arc routing problem
- A parallel insert method for the capacitated arc routing problem
- Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
- The capacitated arc routing problem with refill points
- Capacitated arc routing problem with deadheading demands
- Solving capacitated arc routing problems using a transformation to the CVRP
This page was built for publication: Approximate solutions for the capacitated arc routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121808)
