Privatized rural postman problems

@article{Aroz2006PrivatizedRP,
  title={Privatized rural postman problems},
  author={Juli{\'a}n Ar{\'a}oz and Elena Fern{\'a}ndez and Cristina Zoltan},
  journal={Computers & OR},
  year={2006},
  volume={33},
  pages={3432-3449}
}
In this work we analyze the privatized rural postman problem which is the edge version of the traveling salesman problems with profits. The problem is defined on a undirected graph G(V, E) with a distinguished vertex d, called the Depot. There are two non-negative real functions on the edge set E, which define the value of a cycle in G: one is the profit function, b, and the other one is the cost function, c. They have different meanings when a cycle C traverses an edge e (possibly more than… CONTINUE READING
Highly Cited
This paper has 37 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 23 extracted citations

A Tabu Search Heuristic for the Prize-collecting Rural Postman Problem

Electr. Notes Theor. Comput. Sci. • 2011
View 6 Excerpts
Highly Influenced

New results for the Directed Profitable Rural Postman Problem

European Journal of Operational Research • 2014
View 2 Excerpts

References

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

Matching, Euler tours and the Chinese postman

Math. Program. • 1973
View 4 Excerpts
Highly Influenced

Integer linear models with a polynomial number of variables and constraints for some classical combinatorial optimization problems

N Maculan, G Plateau, A. Lisser
2003

Arc routing: theory, solutions and applications

M. Dror
Kluwer Academic Publishers; • 2000
View 1 Excerpt

Linear programming based methods for solving arc routing problems. In: Dror M, editor. Arc routing: theory, solutions and applications

E Benavent, A Corberán, JM. Sánchis
2000

Similar Papers

Loading similar papers…