KnowraAssignment problemLinked fromLinked fromThe 16 pages that link to Assignment problem, each with the reason it gives.All 16Broader topic 4Related 8Narrower topic 1Compared with 3Bipartite graphRelated: Agents and tasks form opposite vertex sets, with edges representing allowed assignments.Matching (graph theory)Related: Its one-to-one assignments are modeled by matchings, often with edge weights.Bipartite matchingRelated: Ignoring costs leaves the question of whether a complete pairing exists.Perfect matchingRelated: A feasible complete assignment is a perfect matching in a bipartite graph.Rearrangement inequalityRelated: The inequality solves the assignment problem when pair values are products of sorted numbers.Kőnig's theoremRelated: Its unweighted feasibility structure is bipartite matching, where the theorem can certify cardinality optima.Maximum-cardinality matchingRelated: A bipartite maximum matching tests how many agents can receive compatible tasks.Edge coverRelated: Bipartite matching methods related to edge covers also underpin assignment optimization.