We are interested in a minimum-cost matching of taxis to locations. We can produce such a solution by performing a minimum-cost flow algorithm on the flow network derived from the maximum matching problem (as described in Section 8.3), where we add an extra node $s$, connected to all the taxis, and an extra node $t$, connected to all the locations.