A decade of capacitated arc routing
From MaRDI portal
Publication:3564348
Recommendations
Cites work
- scientific article; zbMATH DE number 1703887 (Why is no real title available?)
- scientific article; zbMATH DE number 2134188 (Why is no real title available?)
- scientific article; zbMATH DE number 4053543 (Why is no real title available?)
- scientific article; zbMATH DE number 4068590 (Why is no real title available?)
- scientific article; zbMATH DE number 1975105 (Why is no real title available?)
- scientific article; zbMATH DE number 1520350 (Why is no real title available?)
- scientific article; zbMATH DE number 1749230 (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 3231691 (Why is no real title available?)
- scientific article; zbMATH DE number 956790 (Why is no real title available?)
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
- A cutting plane algorithm for the capacitated arc routing problem
- A decade of capacitated arc routing
- A decision support system for urban waste management
- A deterministic tabu search algorithm for the capacitated arc routing problem
- A fundamental problem in vehicle routing
- A genetic algorithm for a bi-objective capacitated arc routing problem
- A guided local search heuristic for the capacitated arc routing problem
- A linear programming model for the separate refuse collection service.
- A scatter search for the periodic capacitated arc routing problem
- A survey of models and algorithms for winter road maintenance. III: Vehicle routing and depot location for spreading
- A survey of models and algorithms for winter road maintenance. IV: Vehicle routing and fleet sizing for plowing and snow disposal
- A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
- A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
- An approximation algorithm for the general routing problem
- Approximation Algorithms for Some Postman Problems
- Arc Routing Problems, Part I: The Chinese Postman Problem
- Arc Routing Problems, Part II: The Rural Postman Problem
- Arc routing in a node routing environment
- Arc routing problems with time-dependent service costs
- Capacitated arc routing problems
- Competitive memetic algorithms for arc routing problems
- District design for arc-routing applications
- Districting for salt spreading operations
- Evolutionary algorithms for periodic arc routing problems
- Exact methods based on node-routing formulations for undirected arc-routing problems
- Exploiting sparsity in pricing routines for the capacitated arc routing problem
- Graph theory, combinatorics and algorithms. Interdisciplinary applications
- Handbook of metaheuristics
- Heuristic method for a mixed capacitated arc routing problem: A refuse collection application
- Improvement Procedures for the Undirected Rural Postman Problem
- Improving robustness of solutions to arc routing problems
- Lower and upper bounds for the mixed capacitated arc routing problem
- Lower-bounding and heuristic methods for a refuse collection vehicle routing problem
- Matching, Euler tours and the Chinese postman
- Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
- NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM
- New lower bound for the capacitated arc routing problem
- On general routing problems
- On the complexity of edge traversing
- Postman tour on a graph with precedence relation on arcs
- Privatized rural postman problems
- Road network monitoring: algorithms and a case study
- Routeing winter gritting vehicles
- Solving capacitated arc routing problems using a transformation to the CVRP
- The Capacitated Arc Routing Problem: Lower bounds
- The Chinese Postman Problem for Mixed Networks
- The capacitated arc routing problem with intermediate facilities
- The capacitated arc routing problem with refill points
- The capacitated arc routing problem: Valid inequalities and facets
- The fleet size and mix problem for capacitated arc routing
- The rural postman problem with deadline classes
- Transforming arc routing into node routing problems
- Using mixed integer programming for solving the capacitated arc routing problem with vehicle/site dependencies with an application to the routing of residential sanitation collection vehicles
Cited in
(33)- A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands
- Variants of the capacitated arc routing problem
- Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
- An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
- Location-arc routing problem: heuristic approaches and test instances
- Approximate solutions for the capacitated arc routing problem
- Iterated local search and column generation to solve arc-routing as a permutation set-covering problem
- Preface: Special issue on arc routing problems
- Part logistics in the automotive industry: decision problems, literature review and research agenda
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows
- Exact methods based on node-routing formulations for undirected arc-routing problems
- Collaborative vehicle routing: a survey
- An improved heuristic for the capacitated arc routing problem
- The capacitated arc routing problem with refill points
- Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times
- Capacitated arc routing problem with deadheading demands
- The open capacitated arc routing problem
- On games arising from multi-depot Chinese postman problems
- Node, edge, arc routing and turn penalties: multiple problems -- one neighborhood extension
- An updated annotated bibliography on arc routing problems
- A guided local search procedure for the multi-compartment 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
- A decade of capacitated arc routing
- Transforming arc routing into node routing problems
- Recent results on arc routing problems: an annotated bibliography
- An approach to the asymmetric multi-depot capacitated arc routing problem
- The mixed capacitated arc routing problem with non-overlapping routes
- Local search heuristics for sectoring routing in a household waste collection context
- Arc routing problems: A review of the past, present, and future
- Improved lower bounds and exact algorithm for the 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
This page was built for publication: A decade of capacitated arc routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3564348)
