Exact methods based on node-routing formulations for undirected arc-routing problems
From MaRDI portal
Recommendations
- Solving capacitated arc routing problems using a transformation to the CVRP
- A compact transformation of arc routing problems into node routing problems
- Transforming arc routing into node routing problems
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- A decade of capacitated arc routing
Cited in
(35)- Exploiting sparsity in pricing routines for the capacitated arc routing problem
- Lower bounds for the mixed capacitated arc routing problem
- A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands
- Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration
- Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
- Iterated local search and column generation to solve arc-routing as a permutation set-covering problem
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows
- An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
- Transforming arc routing into node routing problems
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- Robust drone selective routing in humanitarian transportation network assessment
- Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition
- Exact approaches for the cutting path determination problem
- A compact transformation of arc routing problems into node routing problems
- Solving capacitated arc routing problems using a transformation to the CVRP
- Arc routing under uncertainty: introduction and literature review
- Recent results on arc routing problems: an annotated bibliography
- Tour splitting algorithms for vehicle routing problems
- A hybrid metaheuristic approach for the capacitated arc routing problem
- Improved bounds for large scale capacitated arc routing problem
- Location-arc routing problem: heuristic approaches and test instances
- A decade of capacitated arc routing
- Transformations of node-balanced routing problems
- scientific article; zbMATH DE number 1568942 (Why is no real title available?)
- Combinatorial optimization and green logistics
- Combinatorial optimization and green logistics
- An improved multi-objective framework for the rich arc routing problem
- Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems
- Divide-and-conquer initialization and mutation operators for the large-scale mixed capacitated arc routing problem
- A polynomial time solvable capacitated arc routing problem on regular grid graphs
- Multi-depot periodic capacitated arc routing problem with intermediate facilities for waste collection
- Arc routing problems with time-dependent service costs
- A deterministic tabu search algorithm for the capacitated arc routing problem
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
- Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows
This page was built for publication: Exact methods based on node-routing formulations for undirected arc-routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3376660)
