scientific article; zbMATH DE number 1568940
From MaRDI portal
Publication:4762467
zbMath0970.90071MaRDI QIDQ4762467
Adam N. Letchford, Richard W. Eglese
Publication date: 21 October 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveyrural postman problemarc routingpolyhedral theorycapacitated arc routing problemchinese postman problem
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (11)
The capacitated arc routing problem with refill points ⋮ Undirected postman problems with zigzagging option: a cutting-plane approach ⋮ Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics ⋮ A Decade of Capacitated Arc Routing ⋮ On the general routing polytope ⋮ Computing finest mincut partitions of a graph and application to routing problems ⋮ An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem ⋮ Lower bounds for the mixed capacitated arc routing problem ⋮ A GRASP heuristic for the mixed Chinese postman problem ⋮ Projection results for vehicle routing ⋮ A cutting plane algorithm for the capacitated arc routing problem
Uses Software
This page was built for publication:
