Multi-depot rural postman problems

@article{Fernndez2017MultidepotRP,
  title={Multi-depot rural postman problems},
  author={Elena Fern{\'a}ndez and Jessica Rodr{\'i}guez-Pereira},
  journal={TOP},
  year={2017},
  volume={25},
  pages={340-372}
}
This paper studies multi-depot rural postman problems on an undirected graph. These problems extend the well-known undirected rural postman problem to the case where there are several depots instead of just one. Linear integer programming formulations that only use binary variables are proposed for the problem that minimizes the overall routing costs and for the model that minimizes the length of the longest route. An exact branch-and-cut algorithm is presented for each considered model, where… CONTINUE READING
BETA

Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 37 REFERENCES

On general routing problems: Comments

  • Networks
  • 1976
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

A novel model for arc territory design: Promoting eulerian districts

G. Garćıa Ayala, J. González-Velarde, R. Ŕıos-Mercado, E. Fernández
  • International Transactions in Operations Research, 23:433–458,
  • 2015
VIEW 1 EXCERPT

Districting for Arc Routing

  • INFORMS Journal on Computing
  • 2014
VIEW 1 EXCERPT

A branch-and-cut for the maximum benefit chinese postman problem

E. Benavent, A. Corberán, +3 authors J. Sanchis
  • Networks, 63:34–45,
  • 2013

A branch-and-cut for the maximum benefit chinese postman problem

A. Corberán, I. Plana, A. Rodŕıguez-Ch́ıa, J. Sanchis
  • Mathematical Programming,
  • 2013
VIEW 2 EXCERPTS