On the mixed Chinese postman problem

DOI10.1016/0167-6377(93)90021-8zbMath0805.90091OpenAlexW2036619365MaRDI QIDQ1319678

V. Pereyra

Publication date: 12 May 1994

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(93)90021-8

zbMATH Keywords

integer linear programmingmixed Chinese postman problemhalf-integrality

Mathematics Subject Classification ID

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

Related Items

Approximation algorithms for solving the constrained arc routing problem in mixed graphs ⋮ Routing problems: A bibliography ⋮ Approximation Algorithms for a Mixed Postman Problem with Restrictions on the Arcs ⋮ New results on the windy postman problem ⋮ Asymptotic surrogate constraint method and its convergence for a class of semi-infinite programming ⋮ Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems ⋮ A comparison of two different formulations for arc routing problems on mixed graphs ⋮ The multi-dimension RSA and its low exponent security ⋮ Separating capacity constraints in the CVRP using tabu search

Cites Work

• The mixed postman problem
• On the complexity of edge traversing
• A fundamental problem in vehicle routing
• Approximation Algorithms for Some Postman Problems
• Matching, Euler tours and the Chinese postman
• Unnamed Item
• Unnamed Item
• Unnamed Item