Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Assignment_problem> ?p ?o. }
Showing items 1 to 31 of
31
with 100 items per page.
- Assignment_problem abstract "The assignment problem is one of the fundamental combinatorial optimization problems in the branch of optimization or operations research in mathematics. It consists of finding a maximum weight matching in a weighted bipartite graph. In its most general form, the problem is as follows:There are a number of agents and a number of tasks. Any agent can be assigned to perform any task, incurring some cost that may vary depending on the agent-task assignment. It is required to perform all tasks by assigning exactly one agent to each task and exactly one task to each agent in such a way that the total cost of the assignment is minimized.If the numbers of agents and tasks are equal and the total cost of the assignment for all tasks is equal to the sum of the costs for each agent (or the sum of the costs for each task, which is the same thing in this case), then the problem is called the linear assignment problem. Commonly, when speaking of the assignment problem without any additional qualification, then the linear assignment problem is meant.".
- Assignment_problem wikiPageID "140592".
- Assignment_problem wikiPageRevisionID "603319582".
- Assignment_problem hasPhotoCollection Assignment_problem.
- Assignment_problem subject Category:Combinatorial_optimization.
- Assignment_problem subject Category:Linear_programming.
- Assignment_problem subject Category:Matching.
- Assignment_problem subject Category:Polynomial-time_problems.
- Assignment_problem type Abstraction100002137.
- Assignment_problem type Attribute100024264.
- Assignment_problem type Condition113920835.
- Assignment_problem type Difficulty114408086.
- Assignment_problem type Polynomial-timeProblems.
- Assignment_problem type Problem114410605.
- Assignment_problem type State100024720.
- Assignment_problem comment "The assignment problem is one of the fundamental combinatorial optimization problems in the branch of optimization or operations research in mathematics. It consists of finding a maximum weight matching in a weighted bipartite graph. In its most general form, the problem is as follows:There are a number of agents and a number of tasks. Any agent can be assigned to perform any task, incurring some cost that may vary depending on the agent-task assignment.".
- Assignment_problem label "Assignment problem".
- Assignment_problem label "Problema de la asignación".
- Assignment_problem label "Problema di assegnazione".
- Assignment_problem label "Problème d'affectation".
- Assignment_problem label "Задача о назначениях".
- Assignment_problem label "任务分配问题".
- Assignment_problem sameAs Problema_de_la_asignación.
- Assignment_problem sameAs Problème_d'affectation.
- Assignment_problem sameAs Problema_di_assegnazione.
- Assignment_problem sameAs m.011jvd.
- Assignment_problem sameAs Q620614.
- Assignment_problem sameAs Q620614.
- Assignment_problem sameAs Assignment_problem.
- Assignment_problem wasDerivedFrom Assignment_problem?oldid=603319582.
- Assignment_problem isPrimaryTopicOf Assignment_problem.