Eulerian location problems

@article{Ghiani1999EulerianLP,
  title={Eulerian location problems},
  author={Gianpaolo Ghiani and Gilbert Laporte},
  journal={Networks},
  year={1999},
  volume={34},
  pages={291-302}
}
The problem of locating a set of depots in an arc routing context (with no side constraints) is addressed. In the case of one depot, it is shown that the problem can be transformed into a Rural Postman Problem (RPP). In the case of a set of depots, the problem is also reduced to an RPP if there are no bounds on the number of depots to be opened or to a RPP relaxation otherwise. The problem is then solved to optimality using a branch-and-cut algorithm. Extensive computational results on real… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 10 references

A polyhedral approach to the rural postman problem

  • A. Corberán, J. M. Sanchis
  • Eur J Oper Res 79
  • 1994
Highly Influential
4 Excerpts

Location-routing problems,” Vehicle routing: Methods and studies, B.L

  • G. Laporte
  • Golden and A.A. Assad, (Editors),
  • 1988
Highly Influential
5 Excerpts

A

  • N. Christofides, V. Campos
  • Corbera ́n, and E. Mota, An algorithm for the…
  • 1981

Matching

  • J. Edmonds, E. L. Johnson
  • Euler tours, and the Chinese postman problem…
  • 1973
1 Excerpt

Shortest connection networks and some generalizations

  • R. C. Prim
  • Bell Syst Tech J 36
  • 1401
2 Excerpts

Similar Papers

Loading similar papers…