Approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem

DOI10.1007/S10898-024-01420-1MaRDI QIDQ6635813

Pengxiang Pan, Jianping Li, Junran Lichen

Publication date: 12 November 2024

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationapproximation algorithmsmixed graphsChinese postman routingvertex traversal times

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cites Work

• Title not available (Why is that?)
• Approximation algorithms for solving the constrained arc routing problem in mixed graphs
• The mixed capacitated arc routing problem with non-overlapping routes
• The vehicle routing problem. Latest advances and new challenges.
• The periodic rural postman problem with irregular services on mixed graphs
• The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm
• Length-constrained path-matchings in graphs
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• On the complexity of edge traversing
• Approximation Algorithms for Some Postman Problems
• A 3/2-Approximation Algorithm for the Mixed Postman Problem
• Matching, Euler tours and the Chinese postman
• Arc Routing
• Maximum matching and a polyhedron with 0,1-vertices
• Combinatorial optimization. Theory and algorithms

This page was built for publication: Approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem

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