A Decade of Capacitated Arc Routing (Q3564348)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	A Decade of Capacitated Arc Routing	scientific article

Statements

scholarly article

0 references

A Decade of Capacitated Arc Routing (English)

0 references

0 references

Operations Research/Computer Science Interfaces

0 references

publication date

2 June 2010

0 references

zbMATH Keywords

arc routing

0 references

CARP

0 references

recent research

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-0-387-77778-8_2

0 references

0 references

A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem

0 references

Lower-bounding and heuristic methods for a refuse collection vehicle routing problem

0 references

Heuristic method for a mixed capacitated arc routing problem: A refuse collection application

0 references

The capacitated arc routing problem with refill points

0 references

Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees

0 references

Privatized rural postman problems

0 references

0 references

Transforming arc routing into node routing problems

0 references

Exact methods based on node-routing formulations for undirected arc-routing problems

0 references

0 references

Lower and upper bounds for the mixed capacitated arc routing problem

0 references

The capacitated arc routing problem: Valid inequalities and facets

0 references

A cutting plane algorithm for the capacitated arc routing problem

0 references

0 references

The Capacitated Arc Routing Problem: Lower bounds

0 references

A guided local search heuristic for the capacitated arc routing problem

0 references

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

0 references

A deterministic tabu search algorithm for the capacitated arc routing problem

0 references

A survey of models and algorithms for winter road maintenance. III: Vehicle routing and depot location for spreading

0 references

A survey of models and algorithms for winter road maintenance. IV: Vehicle routing and fleet sizing for plowing and snow disposal

0 references

Districting for salt spreading operations

0 references

District design for arc-routing applications

0 references

A scatter search for the periodic capacitated arc routing problem

0 references

Solving capacitated arc routing problems using a transformation to the CVRP

0 references

0 references

Postman tour on a graph with precedence relation on arcs

0 references

Matching, Euler tours and the Chinese postman

0 references

Routeing winter gritting vehicles

0 references

The rural postman problem with deadline classes

0 references

0 references

Arc Routing Problems, Part I: The Chinese Postman Problem

0 references

Arc Routing Problems, Part II: The Rural Postman Problem

0 references

A variable neighborhood descent algorithm for a real waste collection problem with mobile depots

0 references

Improving robustness of solutions to arc routing problems

0 references

Approximation Algorithms for Some Postman Problems

0 references

Arc routing problems with time-dependent service costs

0 references

The capacitated arc routing problem with intermediate facilities

0 references

Handbook of metaheuristics

0 references

Capacitated arc routing problems

0 references

A decision support system for urban waste management

0 references

Graph theory, combinatorics and algorithms. Interdisciplinary applications

0 references

A Tabu Search Heuristic for the Capacitated arc Routing Problem

0 references

Improvement Procedures for the Undirected Rural Postman Problem

0 references

A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem

0 references

NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM

0 references

0 references

An approximation algorithm for the general routing problem

0 references

On general routing problems

0 references

0 references

Competitive memetic algorithms for arc routing problems

0 references

Evolutionary algorithms for periodic arc routing problems

0 references

0 references

A genetic algorithm for a bi-objective capacitated arc routing problem

0 references

Road network monitoring: algorithms and a case study

0 references

Exploiting sparsity in pricing routines for the capacitated arc routing problem

0 references

Arc routing in a node routing environment

0 references

A linear programming model for the separate refuse collection service.

0 references

0 references

The Chinese Postman Problem for Mixed Networks

0 references

A fundamental problem in vehicle routing

0 references

On the complexity of edge traversing

0 references

0 references

The fleet size and mix problem for capacitated arc routing

0 references

0 references

A Decade of Capacitated Arc Routing

0 references

New lower bound for the capacitated arc routing problem

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-0-387-77778-8_2

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3564348

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3564348&oldid=35172678"