scientific article
From MaRDI portal
Publication:3159349
zbMath1103.90388MaRDI QIDQ3159349
Publication date: 15 February 2005
Full work available at URL: http://www.ub.uni-heidelberg.de/archiv/4963
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (21)
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 ⋮ Multi-depot rural postman problems ⋮ The shared customer collaboration vehicle routing problem ⋮ 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 generalized arc routing problem ⋮ A branch-and-cut algorithm for the soft-clustered vehicle-routing problem ⋮ A deterministic tabu search algorithm for the capacitated arc routing problem ⋮ A Decade of Capacitated Arc Routing ⋮ The undirected capacitated general routing problem with profits ⋮ An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem ⋮ Min-Max K -vehicles windy rural postman problem ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ A metaheuristic for the min-max windy rural postman problem with K vehicles ⋮ Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes ⋮ Exploiting sparsity in pricing routines for the capacitated arc routing problem ⋮ Analysis of effective sets of routes for the split-delivery periodic inventory routing problem ⋮ A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands ⋮ The min-max close-enough arc routing problem
This page was built for publication:
