assignment problem
S, 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. . . . . [AlgorithmS?] (1999-07-12) Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">In addition Suitable contentS:
[ 2 ] [ = ] [ ai ] [ AL ] [ al ] [ algorithm ] [ am ] [ an ] [ app ] [ ar ] [ aS ] [ aSSignment ] [ at ] [ au ] [ B ] [ b ] [ be ] [ bo ] [ bot ] [ br ] [ C ] [ ca ] [ ch ] [ ci ] [ cl ] [ cm ] [ co ] [ com ] [ con ] [ conS ] [ conStraint ] [ cu ] [ de ] [ du ] [ ec ] [ ed ] [ edu ] [ element ] [ er ] [ et ] [ fo ] [ for ] [ formS ] [ forum ] [ function ] [ G ] [ gh ] [ gn ] [ gS ] [ h ] [ hm ] [ hr ] [ ht ] [ il ] [ in ] [ int ] [ io ] [ ir ] [ iS ] [ it ] [ K ] [ ke ] [ la ] [ ld ] [ li ] [ line ] [ linear aSSignment ] [ lu ] [ lv ] [ ly ] [ ma ] [ mil ] [ ml ] [ mo ] [ mp ] [ mS ] [ mu ] [ nc ] [ ne ] [ nf ] [ ng ] [ ni ] [ nl ] [ nS ] [ O ] [ om ] [ org ] [ pa ] [ pe ] [ pl ] [ pr ] [ re ] [ rl ] [ ro ] [ ru ] [ S ] [ Se ] [ Set ] [ Si ] [ Sig ] [ So ] [ St ] [ Su ] [ Sum ] [ Sy ] [ T ] [ TA ] [ TAL ] [ th ] [ tm ] [ tp ] [ tr ] [ tt ] [ um ] [ uS ] [ ve ] [ vi ] [ wart ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (7280 Reads) |
