scientific article; zbMATH DE number 1568938

MaRDI QIDQ4762465zbMATH OpenFDO

Authors Moshe Dror

Publication date 22 February 2001

zbMATH Keywords

approximation algorithmsarc routingchinese postman problemcombinatorial optimizationcomputational complexitygraph theory

Mathematics Subject Classification ID

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

Recommendations

• The complexity of arc routing problems
• scientific article; zbMATH DE number 1520350
• scientific article; zbMATH DE number 2156293
• An approximation algorithm for the capacitated arc routing problem
• Arc Routing
• The generalized arc routing problem
• Arc routing problems: A review of the past, present, and future
• Approximation algorithms for solving the constrained arc routing problem in mixed graphs
• Approximate solutions for the capacitated arc routing problem
• Approximation algorithms for the arc orienteering problem

Cited in

(12)

• The street sweeping problem
• The complexity of routing with collision avoidance
• Direct routing: Algorithms and complexity
• Arc routing in a node routing environment
• On the computational complexity of continuous routing
• scientific article; zbMATH DE number 1520350 (Why is no real title available?)
• scientific article; zbMATH DE number 2156293 (Why is no real title available?)
• scientific article; zbMATH DE number 1568940 (Why is no real title available?)
• The complexity of arc routing problems
• scientific article; zbMATH DE number 6741961 (Why is no real title available?)
• Algorithms – ESA 2004
• Arc routing problems with time-dependent service costs

This page was built for publication:

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