This paper considers the second-best problem where not all links of a congested transportation networkcan be tolled. The paper builds on earlier work, in which the second-best tax rule for this problem wasderived for general static networks, so that the solution presented is valid for any graph of the network,and for any set of tolling points available on that network. An algorithm is presented for finding second-best tolls, based on this general solution. A simulation model is used for studying its performance forvarious archetype pricing schemes: a toll-cordon, area licences, parking policies in the city centre, pricingof a single major highway, and pay-lanes and 'free-lanes' on major highways. Furthermore, an exploratoryanalysis is given of a method for selecting the optimal location of toll points in case not all links can betolled.