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.

References in periodicals archive ?
Chen, "An Efficient Marginal-Return-Based Constructive Heuristic to Solve the Sensor-Weapon-Target Assignment Problem," IEEE Transactions On Systems, Man, And Cybernetics: Systems.
Within the education domain, this review classified the assignment problem into two: timetabling problem and allocation problem.
From the perspective of the quantity of objective functions, Hosein and Athans [4] classify the WTA problem into two classes: the single-objective weapon-target assignment problem and the multipleobjective weapon-target assignment (MWTA) problem.
The new strategy tries to minimize the communication workload or latency during the shuffle phase, and it solves the problem based on the Linear Assignment Problem. In this section, we present details about the topology-aware two-phase I/O.
(ii) Considering the battery limitations of the cognitive poles, we formulate the channel assignment problem at the CRGW as an energy efficiency maximization problem which is a nonlinear programming (NLP) problem.
As a rational extension of traffic assignment problem, Nagurney, Ramanujam, and Dhanda [12] extended the environmental constrained traffic assignment problem to the case of multimodal traffic network.
At last we have applied the 2-DNS Algorithm for solving neutrosophic multicriteria assignment problem in medical science to evaluate the effectiveness of different modalities of treatment of a disease.
A heuristic algorithm is proposed for handling the channel assignment problem. Then a greedy heuristic algorithm schedules the link to time slots for meeting the expected load on each link.
The component assignment problem (CAP) [1] is a kind of classic problem in the optimization of system reliability.
The three problems (1)-(3) concern the well-known eigenvalue assignment problem (EAP) for discrete-time systems.
Since the crowdsensing task assignment problem is NP-hard, we design the optimal algorithm based on particle swarm optimization (PSO) to solve this problem in this section.