scientific article; zbMATH DE number 3871059

MaRDI QIDQ3337973zbMATH OpenFDO

Authors Enrique Benavent, Vicente Campos, Ángel Corberán, Enrique Mota, Nicos Christofides

Publication date 1984

zbMATH Keywords

branch and boundcomputational resultsexact algorithmLagrangean boundsmixed chinese postman problemmixed graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Programming involving graphs or networks (90C35)

Recommendations

• An optimal algorithm for the mixed Chinese postman problem
• A heuristic algorithm for the mixed Chinese postman problem
• Algorithms for the Chinese postman problem on mixed networks
• Finding postal carrier walk paths in mixed graphs
• A GRASP heuristic for the mixed Chinese postman problem

Cited in

(29)

• A cutting plane algorithm for the windy postman problem
• On the mixed Chinese postman problem
• Algorithms for the windy postman problem
• Finding postal carrier walk paths in mixed graphs
• The mixed general routing polyhedron
• ARC: A computerized system for urban garbage collection
• A GRASP heuristic for the mixed Chinese postman problem
• A heuristic algorithm for the mixed Chinese postman problem
• Algorithms for the Chinese postman problem on mixed networks
• Routing problems: A bibliography
• Postman problems on series-parallel mixed graphs
• New results on 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
• Approximation algorithms for solving the constrained arc routing problem in mixed graphs
• scientific article; zbMATH DE number 4208107 (Why is no real title available?)
• Structural parameterizations of the mixed Chinese postman problem
• Feasibility of the Mixed Postman Problem with Restrictions on the Edges
• scientific article; zbMATH DE number 4023051 (Why is no real title available?)
• scientific article; zbMATH DE number 1187150 (Why is no real title available?)
• scientific article; zbMATH DE number 1179832 (Why is no real title available?)
• A 3/2-Approximation Algorithm for the Mixed Postman Problem
• An optimal algorithm for the mixed Chinese postman problem
• scientific article; zbMATH DE number 1418032 (Why is no real title available?)
• Variants of the mixed postman problem solvable using linear programming
• The Rural Postman Problem on mixed graphs with turn penalties
• Approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem
• Minimum cost nowhere-zero flows and cut-balanced orientations
• The arc partitioning problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3337973)