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 3Linear programmingBroader topic: It is a special linear program with one-to-one assignment constraints.Bipartite graphRelated: Agents and tasks form opposite vertex sets, with edges representing allowed assignments.Integer programmingBroader topic: Binary decision variables represent pairings between agents and tasks.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.Transportation problemBroader topic: It is a special case with unit supplies and demands.Rearrangement inequalityRelated: The inequality solves the assignment problem when pair values are products of sorted numbers.Circulation problemCompared with: It is a specialized matching model, often solved through a flow construction rather than general circulation.Minimum-cost flow problemBroader topic: Unit supplies, unit demands, and assignment arcs yield this familiar special case.Hungarian algorithmNarrower topic: The Hungarian algorithm is a specialized method for solving this problem.Kőnig's theoremRelated: Its unweighted feasibility structure is bipartite matching, where the theorem can certify cardinality optima.Blossom algorithmCompared with: Bipartite assignment has specialized algorithms; blossoms handle pairings with general-graph structure.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.Stable matching problemCompared with: It optimizes a specified objective rather than requiring stability under individual preferences.
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 3Linear programmingBroader topic: It is a special linear program with one-to-one assignment constraints.Bipartite graphRelated: Agents and tasks form opposite vertex sets, with edges representing allowed assignments.Integer programmingBroader topic: Binary decision variables represent pairings between agents and tasks.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.Transportation problemBroader topic: It is a special case with unit supplies and demands.Rearrangement inequalityRelated: The inequality solves the assignment problem when pair values are products of sorted numbers.Circulation problemCompared with: It is a specialized matching model, often solved through a flow construction rather than general circulation.Minimum-cost flow problemBroader topic: Unit supplies, unit demands, and assignment arcs yield this familiar special case.Hungarian algorithmNarrower topic: The Hungarian algorithm is a specialized method for solving this problem.Kőnig's theoremRelated: Its unweighted feasibility structure is bipartite matching, where the theorem can certify cardinality optima.Blossom algorithmCompared with: Bipartite assignment has specialized algorithms; blossoms handle pairings with general-graph structure.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.Stable matching problemCompared with: It optimizes a specified objective rather than requiring stability under individual preferences.