Determine a product-optimal matching for the graph with respect to the weight matrix of Example 14.2.5; that is, we seek a perfect matching for which the product of the weights of its edges is maximal. Hint: Apply the Hungarian algorithm within the group (Q+, ・); note that the zero of this group is 1, and that the positive elements are the numbers ≥ 1.
