The Capacitated Arc Routing Problem: Lower bounds
From MaRDI portal
Recommendations
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- New lower bounds for the Capacitated Arc Routing Problem
- The capacitated arc routing problem: combinatorial lower bounds
- New lower bound for the capacitated arc routing problem
- The capacitated arc routing problem. A heuristic algorithm
Cited in
(66)- An improved heuristic for the capacitated arc routing problem
- Exploiting sparsity in pricing routines for the capacitated arc routing problem
- Lower bounds for the mixed capacitated arc routing problem
- The fleet size and mix problem for capacitated arc routing
- The capacitated arc routing problem: Valid inequalities and facets
- An efficiency-based path-scanning heuristic for the capacitated arc routing problem
- Hybrid genetic algorithm for the open capacitated arc routing problem
- Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
- The undirected capacitated general routing problem with profits
- An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
- Bounds and heuristics for the shortest capacitated paths problem
- A cutting plane algorithm for the capacitated arc routing problem
- A guided local search heuristic for the capacitated arc routing problem
- Solvable cases of the \(k\)-person Chinese postman problem
- Routing problems: A bibliography
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- Lower-bounding and heuristic methods for a refuse collection vehicle routing problem
- Local-ideal-points based autonomous space decomposition framework for the multi-objective periodic generalized directed rural postman problem under length restrictions with intermediate facilities
- Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition
- Lower and upper bounds for location-arc routing problems with vehicle capacity constraints
- A compact transformation of arc routing problems into node routing problems
- Profitable mixed capacitated arc routing and related problems
- Solving an urban waste collection problem using ants heuristics
- Lower and upper bounds for the mixed capacitated arc routing problem
- A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
- New lower bound for the capacitated arc routing problem
- The directed profitable location rural postman problem
- A scatter search for the periodic capacitated arc routing problem
- Solving capacitated arc routing problems using a transformation to the CVRP
- The capacitated arc routing problem with refill points
- The capacitated arc routing problem with intermediate facilities
- Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem
- On the vehicle routing problem with lower bound capacities
- The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem
- New results for the directed profitable rural postman problem
- A hybrid metaheuristic approach for the capacitated arc routing problem
- Improved bounds for large scale capacitated arc routing problem
- GRASP with evolutionary path-relinking for the capacitated arc routing problem
- Location-arc routing problem: heuristic approaches and test instances
- A lower bound for the node, edge, and arc routing problem
- Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
- A decade of capacitated arc routing
- Bounds and Heuristics for Capacitated Routing Problems
- New lower bounds for the Capacitated Arc Routing Problem
- NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM
- An ILP-refined tabu search for the directed profitable rural postman problem
- A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem
- An open-source desktop application for generating arc-routing benchmark instances
- The capacitated arc routing problem: combinatorial lower bounds
- scientific article; zbMATH DE number 232390 (Why is no real title available?)
- The capacitated arc routing problem. A heuristic algorithm
- New upper bounds for the multi-depot capacitated arc routing problem
- New large-scale data instances for CARP and new variations of CARP
- 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
- On matchings, T‐joins, and arc routing in road networks
- Fast upper and lower bounds for a large‐scale real‐world arc routing problem
- Approximation algorithms for the restricted k-Chinese postman problems with penalties
- A parameterized lower bounding method for the open capacitated arc routing problem
- A multi-level capacitated arc routing problem with intermediate facilities in waste collection
- The open capacitated arc routing problem
- Multi-depot periodic capacitated arc routing problem with intermediate facilities for waste collection
- A deterministic tabu search algorithm for the capacitated arc routing problem
- Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions
This page was built for publication: The Capacitated Arc Routing Problem: Lower bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4022732)
