Approximation algorithms for two clustered arc routing problems

DOI10.1007/S10878-024-01190-2MaRDI QIDQ6645185

Xiaoguang Bao, Xinhao Ni

Publication date: 28 November 2024

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

zbMATH Keywords

clusterapproximation algorithmrural postman problemarc routingstacker crane problem

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Title not available (Why is that?)
• The generalized arc routing problem
• The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm
• An algorithm for the hierarchical Chinese postman problem
• Approximation algorithms with constant ratio for general cluster routing problems
• On the hierarchical Chinese postman problem with linear ordered classes
• The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable
• Postman tour on a graph with precedence relation on arcs
• On general routing problems
• Approximation Algorithms for Some Postman Problems
• A Generalized Traveling Salesman Problem Approach to the Directed Clustered Rural Postman Problem
• Matching, Euler tours and the Chinese postman
• Arc Routing Problems, Part II: The Rural Postman Problem
• Arc Routing

This page was built for publication: Approximation algorithms for two clustered arc routing problems

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