A cutting plane algorithm for the capacitated arc routing problem
From MaRDI portal
Recommendations
- The capacitated arc routing problem: Valid inequalities and facets
- The capacitated arc routing problem. A heuristic algorithm
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- The Capacitated Arc Routing Problem: Lower bounds
- Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem
Cites work
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- Approximate solutions for the capacitated arc routing problem
- Arc Routing Problems, Part I: The Chinese Postman Problem
- Arc Routing Problems, Part II: The Rural Postman Problem
- Capacitated arc routing problems
- scientific article; zbMATH DE number 1703887 (Why is no real title available?)
- scientific article; zbMATH DE number 4068590 (Why is no real title available?)
- scientific article; zbMATH DE number 558539 (Why is no real title available?)
- scientific article; zbMATH DE number 1520350 (Why is no real title available?)
- scientific article; zbMATH DE number 1568940 (Why is no real title available?)
- scientific article; zbMATH DE number 1568941 (Why is no real title available?)
- scientific article; zbMATH DE number 232390 (Why is no real title available?)
- scientific article; zbMATH DE number 956790 (Why is no real title available?)
- New lower bounds for the Capacitated Arc Routing Problem
- Odd Minimum Cut-Sets and b-Matchings
- The Capacitated Arc Routing Problem: Lower bounds
- The capacitated arc routing problem: Valid inequalities and facets
- The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
Cited in
(47)- 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
- 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
- The undirected capacitated general routing problem with profits
- An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
- Capacitated arc routing problem with deadheading demands
- Evolutionary algorithms for periodic arc routing problems
- A guided local search heuristic for the capacitated arc routing problem
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- Arc routing for parking enforcement officers: exact and heuristic solutions
- Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition
- Lower and upper bounds for the mixed capacitated arc routing problem
- A genetic algorithm for a bi-objective capacitated arc routing problem
- A scatter search for the periodic capacitated arc routing problem
- Solving capacitated arc routing problems using a transformation to the CVRP
- The mixed capacitated general routing problem under uncertainty
- A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands
- Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem
- Recent results on arc routing problems: an annotated bibliography
- Tour splitting algorithms for vehicle routing problems
- Two-phase branch-and-cut for the mixed capacitated general routing problem
- An approach to the asymmetric multi-depot capacitated arc routing problem
- Improved bounds for large scale capacitated arc routing problem
- GRASP with evolutionary path-relinking for the capacitated arc routing problem
- Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
- A decade of capacitated arc routing
- Modeling and solving the mixed capacitated general routing problem
- Crossover iterated local search for SDCARP
- Cut-first branch-and-price-second for the capacitated arc-routing problem
- An exact algorithm for the capacitated arc routing problem with deadheading demand
- Local search for the undirected capacitated arc routing problem with profits
- A cutting plane algorithm for the general routing problem
- Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems
- Fast upper and lower bounds for a large‐scale real‐world arc routing problem
- A parameterized lower bounding method for the open capacitated arc routing problem
- 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
- The open capacitated arc routing problem
- A parallel insert method for the capacitated arc routing problem
- An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems
- A deterministic tabu search algorithm for the capacitated arc routing problem
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
- The undirected capacitated arc routing problem with profits
This page was built for publication: A cutting plane algorithm 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 Q1870825)
