“…The above CPP and RPP definitions for undirected graphs have been generalised in many ways, and algorithms catering for directed and mixed graphs, for example, have been introduced -see Ball et al (1995), Dror (2000) and Eiselt et al (1995aEiselt et al ( , 1995b for an overview. These versions of the RPP have many applications -see, for example, Angel et al (1972), Beltrami and Bodin (1974), Bennet and Gazis (1972), Bodin and Berman (1979), Bodin et al (1989), Bodin and Kursh (1979), Braca et al (1993), Desrosiers et al (1986), Eglese (1994), Eglese and Murdock (1991), Gelders and Cattrysse (1991), Ghiani and Improta (2001), Grötschel et al (1991), Levy and Bodin (1988), Roy and Rousseau (1989), Stern and Dror (1979) and Wunderlich et al (1992).…”