23 followers
The assignment problem is polynomial for most aggregating functions (sum, min, leximin), but NP-hard for OWA with decreasing weights. However, there is a polynomial algorithm for a bounded number of different weights, see https://t.co/jiIQFOKTy0 published