Two special cases of the assignment problem

Two special cases of the assignment problem

a Y. t‘ ft I.___.____..__ .Y E P ur problem is to determine ctian that HE( y& = I?!“( ysh ,) R.M. Kwp, S.- Y.R. Li / The assignment prob...

1MB Sizes 0 Downloads 86 Views

a Y.

t‘

ft

I.___.____..__

.Y

E

P

ur problem is to determine

ctian that HE( y& = I?!“( ysh ,)
(s) instead of qkI,

,

133

af. Csnsic.er ar; inte

ing no ekmer.t of S U T. te the contributions of

interval I to each si

3

.I I_

9

)

-9

a*‘9

e only point that is nst obvious is that

k=

I,

* ~3tisfki (5); i.e.,

2, .,.S e -’ I.

ion.

irs

\ h n

-

0

..

; each point: in. S u T is assigned a coordinate s fr ( lacement fmn m arbitrary zero point hich is net in

the cost of ali

6

the cost

of the assignment

-e. d

‘_4

E

c< z:’

e describe the

case with

conrpLltation

0. bough d&ii

ad the nlinimizing

in tlw

cirs~~lar

is given ta demanstrak that thy entire tion GUI be perfosnred in, at most ZOlSt arithmetic steps (addi4x3mparissns of raumbers). On cm show shilarly tlut, in the e enleire computatian can e carried out in 23number of 4 >

R.M. Kwp, S.- Y.R. Li / The assignment problem

141

e

f-2