Undirected postman problems with zigzagging option: a cutting-plane approach

DOI10.1016/j.cor.2007.07.002zbMath1278.90341OpenAlexW1992468859MaRDI QIDQ925846

Stefan Irnich

Publication date: 23 May 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2007.07.002

zbMATH Keywords

polyhedral theorypostman problemszigzagging

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items

Hierarchical Chinese postman problem with fuzzy travel times, The windy rural postman problem with a time-dependent zigzag option, Recent results on Arc Routing Problems: An annotated bibliography

Uses Software

• CPLEX

Cites Work

• The ellipsoid method and its consequences in combinatorial optimization
• The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra
• A polyhedral approach to the rural postman problem
• A branch-and-cut algorithm for the undirected rural postman problem
• A cutting plane algorithm for minimum perfect 2-matchings
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Odd Minimum Cut Sets and b-Matchings Revisited
• Solving matching problems with linear programming
• Multi-Terminal Network Flows
• Odd Minimum Cut-Sets and b-Matchings
• Matching, Euler tours and the Chinese postman
• Arc Routing Problems, Part II: The Rural Postman Problem
• Integer Programming and Combinatorial Optimization
• A Note on Postman Problems with Zigzag Service
• Unnamed Item
• Unnamed Item