assignment problem

Also found in: Wikipedia.

assignment problem

[ə′sīn·mənt ′präb·ləm]
(computer science)
A special case of the transportation problem in a linear program, in which the number of sources (assignees) equals the number of designations (assignments) and each supply and each demand equals 1.

assignment problem

(mathematics, algorithm)
(Or "linear assignment") Any problem involving minimising the sum of C(a, b) over a set P of pairs (a, b) where a is an element of some set A and b is an element of set B, and C is some function, under constraints such as "each element of A must appear exactly once in P" or similarly for B, or both.

For example, the a's could be workers and the b's projects.

The problem is "linear" because the "cost function" C() depends only on the particular pairing (a, b) and is independent of all other pairings.

http://forum.swarthmore.edu/epigone/comp.soft-sys.matlab/bringhyclu. http://soci.swt.edu/capps/prob.htm. http://mat.gsia.cmu.edu/GROUP95/0577.html. http://informs.org/Conf/WA96/TALKS/SB24.3.html.

Mentioned in ?
References in periodicals archive ?
Kar et al  have proposed two different methods for solving a neutrosophic multi-criteria assignment problem.
A heuristic algorithm is proposed for handling the channel assignment problem.
Variables represent joint flows on doublets and triplets of arcs on an assignment problem graph, resulting in a model whose feasible set consists of points corresponding to convex combinations of desired solutions only.
The model with fuzzy teaching preference provides a more satisfactory solution to a course assignment problem than assigning arbitrary weights.
The paper, The Random Hypergraph Assignment Problem, generalizes Parisi's proven conjecture on the expected optimal cost value of an assignment problem on a complete bipartite graph to a class of bipartite hypergraphs.
The notion L(p, q)-labeling (for integers p [greater than or equal to] q [greater than or equal to] 1) is inspired by the frequency assignment problem in telecommunication.
Hale  in 1980 initiated the problem to determine the minimum number of channels in a given network which is now popular as a channel assignment problem.
In our work, the first proposal is that the channel assignment problem using the graph edge coloring method and we propose a new routing metric called signal-to-noise plus interference ratio (SINR) value which measures interference in each link and then routing algorithm works based on the interference information.
From this premise, the objective of this paper is to propose a mathematical model representing the characteristics of the course timetable and classroom assignment problem at Universidad de La Sabana, Colombia.
Coverage Extension Here address the relay assignment problem for implementing cooperative diversity protocols to extend coverage area in wireless networks, as depicted in Figure 2.

Site: Follow: Share:
Open / Close