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

Authors:
Stefan Irnich
Affiliations:
Deutsche Post Endowed Chair of Optimization of Distribution Networks, RWTH Aachen University, Templergraben 64, D-52056 Aachen, Germany
Venue:
Computers and Operations Research
Year:
2008

Citing 4
Cited 0

A new approach to the maximum flow problem

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A cutting plane algorithm for minimum perfect 2-matchings

Computing
A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems

SIAM Review
Data structures for weighted matching and nearest common ancestors with linking

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.01

Visualization

Abstract

The paper devises a new model and associated cutting-plane and branch-and-cut approaches for a variant of the undirected Chinese and rural postman problem where some of the edges offer the flexibility of either being serviced twice by two separate traversals or by a single zigzag traversal. The kernel of the proposed cutting-plane algorithm is a separation procedure for generalized blossom inequalities. We show that the currently best known separation procedure of Letchford, Reinelt and Theis [A faster exact separation algorithm for blossom inequalities. In: Nemhauser G, Bienstock D, editors, Integer programming and combinatorial optimization, vol. 3064. Berlin: Springer; 2004. (chapter 10)] is applicable and leads to a highly efficient solution approach which can handle large-scale problem instances.