scientific article
From MaRDI portal
Publication:3801316
zbMath0654.90034MaRDI QIDQ3801316
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveyheuristicscutting plane algorithmsChinese postmanpostman problemswindy postmanpolyhedral resultsundirected capacitated postman
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Polytopes and polyhedra (52Bxx)
Related Items (17)
A polyhedral approach to the rural postman problem ⋮ A branch & cut algorithm for the windy general routing problem and special cases ⋮ Lower bounds and heuristics for the windy rural postman problem ⋮ New heuristic algorithms for the windy rural postman problem ⋮ Routing problems: A bibliography ⋮ On matchings, T‐joins, and arc routing in road networks ⋮ Improved lower bounds and exact algorithm for the capacitated arc routing problem ⋮ New results on the windy postman problem ⋮ Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics ⋮ A Decade of Capacitated Arc Routing ⋮ A cutting plane algorithm for the windy postman problem ⋮ Series-parallel graphs are windy postman perfect ⋮ Solution of real-world postman problems ⋮ Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ On the mixed Chinese postman problem ⋮ A cutting plane algorithm for the capacitated arc routing problem
This page was built for publication:
