New results on the windy postman problem

DOI10.1007/S10107-010-0399-XMaRDI QIDQ2429464zbMATH OpenOpenAlexFDO

Authors Marcus Oswald, Isaac Plana, Ángel Corberán, Gerhard Reinelt, José M. 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

arc routingfacetsmixed Chinese postman problempolyhedral combinatoricswindy postman problem

Mathematics Subject Classification ID

Integer programming (90C10) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Algorithms for the windy postman problem
• A cutting plane algorithm for the windy postman problem
• A branch & cut algorithm for the windy general routing problem and special cases
• On the windy postman problem
• The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra

Cites work

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

Cited in

(14)

• A cutting plane algorithm for the windy postman problem
• Algorithms for the windy postman problem
• Integer programming formulation and polyhedral results for windy collaborative arc routing problem
• Profitable mixed capacitated arc routing and related problems
• Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems
• Recent results on arc routing problems: an annotated bibliography
• An approach to the asymmetric multi-depot capacitated arc routing problem
• The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
• Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm
• A branch & cut algorithm for the windy general routing problem and special cases
• An updated annotated bibliography on arc routing problems
• A branch-and-cut algorithm for the windy profitable location rural postman problem
• On the windy postman problem
• Undirected postman problems with zigzagging option: a cutting-plane approach

This page was built for publication: New results on the windy postman problem

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