  In this paper we consider a set of origin-destination pairs in a mixed model
in which a network embedded in the plane represents an alternative high-speed
transportation system, and study a trip covering problem which consists on
locating two points in the network which maximize the number of covered pairs,
that is, the number of pairs which use the network by acceding and exiting
through such points.
