Open Access
RAIRO-Oper. Res.
Volume 56, Number 3, May-June 2022
Page(s) 1283 - 1291
Published online 02 June 2022
  • J. Aráoz, E. Fernández and C. Zoltan, Privatized rural postman problems. Comput. Oper. Res. 33 (2006) 3432–3449. [CrossRef] [Google Scholar]
  • J. Aráoz, E. Fernández and O. Meza, Solving the prize-collecting rural postman problem. Eur. J. Oper. Res. 196 (2009) 886–896. [CrossRef] [Google Scholar]
  • N. Christofides, Worst-case analysis of a new heuristic for the travelling salesman problem, Management Sciences Research Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA (1976). [Google Scholar]
  • A. Corberán, I. Plana, A.M. Rodríguez-Chía and J.M. Sanchis, A branch-and-cut algorithm for the maximum benefit Chinese postman problem. Math. Program. 141 (2013) 21–48. [CrossRef] [MathSciNet] [Google Scholar]
  • J. Edmonds, Maximum matching and a polyhedron with 0,1-vertices. J. Res. Natl. Bur. Stand. Sect. B 69 (1965) 125–130. [CrossRef] [Google Scholar]
  • J. Edmonds, The Chinese postman’s problem. Bull. Oper. Res. Soc. Am. 13 (1965) 73. [Google Scholar]
  • J. Edmonds and E.L. Johnson, Matching, Euler tours and the Chinese postman. Math. Program. 5 (1973) 88–124. [CrossRef] [Google Scholar]
  • H.N. Gabow, Implementation of algorithms for maximum matching on nonbipartite graphs. Ph.D. thesis, Department of Computer Science, Stanford University, Stanford, California (1973). [Google Scholar]
  • M.-g. Guan, Graphic programming using odd or even points. Acta Math. Sin. 10 (1960) 263–266. [Google Scholar]
  • B. Korte and J. Vygen, Combinatorial Optimization-Theory and Algorithms, 6th ed., Springer, Heidelberg (2018). [CrossRef] [Google Scholar]
  • E.L. Lawler, Combinatorial Optimization: Networks and Matroids, edited by Holt, Rinehart and Winston. New York (1976). [Google Scholar]
  • J.K. Lenstra and A.H.G. Rinnooy Kan, On general routing problems. Networks 6 (1976) 593–597. [Google Scholar]
  • C. Malandraki and M.S. Daskin, The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem. Eur. J. Oper. Res. 65 (1993) 218–234. [CrossRef] [Google Scholar]
  • W.L. Pearn and K.L. Wang, On the maximum benefit Chinese postman problem. Omega 31 (2003) 269–273. [CrossRef] [Google Scholar]
  • W.L. Pearn and W.C. Chiu, Approximate solutions for the maximum benefit Chinese postman problem. Int. J. Syst. Sci. 36 (2005) 815–822. [CrossRef] [Google Scholar]
  • A. Schrijver, Combinatorial Optimization-Polyhedra and Efficiency. Springer, Heidelberg (2003). [Google Scholar]
  • R. Sedgewick, Algorithms in C, Part 5: Graph Algorithms, 3rd ed., Addison-Wesley, (2002). [Google Scholar]
  • A. Shafahi and A. Haghani, Generalized maximum benefit multiple Chinese postman problem. Transp. Res. Part C Emerg. Technol. 55 (2015) 261–272. [CrossRef] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.