Postman problems on series-parallel mixed graphs

DOI10.1016/j.orl.2020.03.012OpenAlexW3015905639MaRDI QIDQ2183202

F. J. Zaragoza Martínez

Publication date: 26 May 2020

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

Full work available at URL: https://doi.org/10.1016/j.orl.2020.03.012

zbMATH Keywords

series-parallel graphsmixed graphspostman problems

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Parameterized complexity of the \(k\)-arc Chinese postman problem
• On the windy postman problem
• Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
• Linear time algorithms for NP-hard problems restricted to partial k- trees
• On the windy postman problem on Eulerian graphs
• The ellipsoid method and its consequences in combinatorial optimization
• A partial k-arboretum of graphs with bounded treewidth
• Series-parallel graphs are windy postman perfect
• Approximation Algorithms for a Mixed Postman Problem with Restrictions on the Arcs
• Feasibility of the Mixed Postman Problem with Restrictions on the Edges
• The Chinese Postman Problem for Mixed Networks
• Odd Minimum Cut-Sets and b-Matchings
• On the complexity of edge traversing
• Matching, Euler tours and the Chinese postman
• Arc Routing Problems, Part II: The Rural Postman Problem
• SOFSEM 2005: Theory and Practice of Computer Science