New results on the windy postman problem

DOI10.1007/s10107-010-0399-xzbMath1237.90165MaRDI QIDQ2429464

Marcus Oswald, Isaac Plana, Angel Corberán, Gerhard Reinelt, José María Sanchis

Publication date: 27 April 2012

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-010-0399-x

zbMATH Keywords

facets; polyhedral combinatorics; arc routing; windy postman problem; mixed Chinese postman problem

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C10: Integer programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

Related Items

An approach to the asymmetric multi-depot capacitated arc routing problem, Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm, Profitable mixed capacitated arc routing and related problems, Recent results on Arc Routing Problems: An annotated bibliography

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the windy postman problem
• Applying mod-\(k\)-cuts for solving linear ordering problems
• Lower bounds and heuristics for the windy rural postman problem
• On the windy postman problem on Eulerian graphs
• The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities
• A cutting plane algorithm for the windy postman problem
• On the mixed Chinese postman problem
• On the separation of maximally violated mod-\(k\) cuts
• Series-parallel graphs are windy postman perfect
• Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems
• The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
• The Chinese Postman Problem for Mixed Networks
• On the complexity of edge traversing
• A branch & cut algorithm for the windy general routing problem and special cases