scientific article
From MaRDI portal
Publication:3337973
zbMath0546.90096MaRDI QIDQ3337973
Vicente Campos, Enrique Mota, Angel Corberán, Enrique Benavent, Nicos Christofides
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
branch and boundcomputational resultsexact algorithmmixed graphLagrangean boundsmixed chinese postman problem
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Integer programming (90C10)
Related Items (12)
Algorithms for the windy postman problem ⋮ Approximation algorithms for solving the constrained arc routing problem in mixed graphs ⋮ Algorithms for the Chinese postman problem on mixed networks ⋮ Routing problems: A bibliography ⋮ New results on the windy postman problem ⋮ A cutting plane algorithm for the windy postman problem ⋮ Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems ⋮ A comparison of two different formulations for arc routing problems on mixed graphs ⋮ The Rural Postman Problem on mixed graphs with turn penalties ⋮ ARC: A computerized system for urban garbage collection ⋮ A GRASP heuristic for the mixed Chinese postman problem ⋮ The arc partitioning problem
This page was built for publication:
