scientific article; zbMATH DE number 2134188

MaRDI QIDQ3159349zbMATH OpenFDO

Authors Dino Ahr

Publication date 15 February 2005

Full work available at URL http://www.ub.uni-heidelberg.de/archiv/4963

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• scientific article; zbMATH DE number 1947382
• A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
• Arc Routing Problems, Part I: The Chinese Postman Problem
• scientific article; zbMATH DE number 2156293
• Improved lower bounds and exact algorithm for the capacitated arc routing problem

Cited in

(27)

• Exploiting sparsity in pricing routines for the capacitated arc routing problem
• A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands
• The shared customer collaboration vehicle routing problem
• The generalized arc routing problem
• The undirected capacitated general routing problem with profits
• An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
• Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes
• Analysis of effective sets of routes for the split-delivery periodic inventory routing problem
• The min-max close-enough arc routing problem
• A branch-and-cut algorithm for the soft-clustered vehicle-routing problem
• Multi-depot rural postman problems
• A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
• Min-Max K-vehicles windy rural postman problem
• Recent results on arc routing problems: an annotated bibliography
• Two-phase branch-and-cut for the mixed capacitated general routing problem
• Improved bounds for large scale capacitated arc routing problem
• On the collaboration uncapacitated arc routing problem
• A decade of capacitated arc routing
• The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
• scientific article; zbMATH DE number 1179832 (Why is no real title available?)
• scientific article; zbMATH DE number 1947382 (Why is no real title available?)
• 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
• The paired mail carrier problem
• A parameterized lower bounding method for the open capacitated arc routing problem
• A deterministic tabu search algorithm for the capacitated arc routing problem
• A metaheuristic for the min-max windy rural postman problem with K vehicles

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3159349)