Module sparse_linear_assignment::symmetric [−][src]
Structs
| ForwardAuctionSolver | Solver for weighted perfect matching problem (also known as linear assignment problem) with good runtime complexity for symmetric sparse bipartite graphs. It finds ε-optimal assignment of N people -> M objects (N <= M), by having people ‘bid’ for objects in parallel. For symmetric problem it uses ε-scaling. |