Publication:3159349

zbMath1103.90388MaRDI QIDQ3159349

Dino Ahr

Publication date: 15 February 2005

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

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C27: Combinatorial optimization

Related Items

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, 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 deterministic tabu search algorithm for the capacitated arc routing problem, A metaheuristic for the min-max windy rural postman problem with K vehicles, 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, Min-Max K -vehicles windy rural postman problem, Recent results on Arc Routing Problems: An annotated bibliography, A Decade of Capacitated Arc Routing