scientific article; zbMATH DE number 4068590

MaRDI QIDQ3801316zbMATH OpenFDO

Authors Zaw Win

Publication date 1987

zbMATH Keywords

Chinese postmancutting plane algorithmsheuristicspolyhedral resultspostman problemssurveyundirected capacitated postmanwindy postman

Mathematics Subject Classification ID

Polytopes and polyhedra (52Bxx) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• Arc Routing Problems, Part I: The Chinese Postman Problem
• A cutting plane algorithm for the windy postman problem
• The Capacitated Canadian Postman Problem
• scientific article; zbMATH DE number 3880464
• Algorithms for the windy postman problem

Cited in

(19)

• A cutting plane algorithm for the windy postman problem
• On the mixed Chinese postman problem
• A polyhedral approach to the rural postman problem
• Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
• A cutting plane algorithm for the capacitated arc routing problem
• Routing problems: A bibliography
• Improved lower bounds and exact algorithm for the capacitated arc routing problem
• New heuristic algorithms for the windy rural postman problem
• New results on 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
• A decade of capacitated arc routing
• Challenges and Advances in A Priori Routing
• The Capacitated Canadian Postman Problem
• A branch & cut algorithm for the windy general routing problem and special cases
• On matchings, T‐joins, and arc routing in road networks
• Lower bounds and heuristics for the windy rural postman 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 Q3801316)