Capacitated arc routing problems

@article{Golden1981CapacitatedAR,
  title={Capacitated arc routing problems},
  author={Bruce L. Golden and Richard T. Wong},
  journal={Networks},
  year={1981},
  volume={11},
  pages={305-315}
}
A capacitated node routing problem, known as the vehicle routing or dispatch problem, has been the focus of much research attention. On the other hand, capacitated arc routing problems have been comparatively neglected. Both classes of problems are extremely rich in theory and applications. Our intent in this paper is to define a capacitated arc routing problem, to provide mathematical programming formulations, to perform a computational complexity analysis, and to present an approximate… CONTINUE READING

Similar Papers

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 185 CITATIONS

An Approximation Algorithm for the Capacitated Arc Routing Problem

VIEW 8 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

A hierarchical relaxations lower bound for the capacitated arc routing problem

  • Proceedings of the 35th Annual Hawaii International Conference on System Sciences
  • 2002
VIEW 13 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Memetic algorithm with route decomposing for periodic capacitated arc routing problem

  • Appl. Soft Comput.
  • 2017
VIEW 6 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1992
2019

CITATION STATISTICS

  • 47 Highly Influenced Citations

  • Averaged 8 Citations per year from 2017 through 2019