<s>
In	O
combinatorial	O
optimization	O
,	O
a	O
field	O
within	O
mathematics	O
,	O
the	O
linear	B-Algorithm
bottleneck	I-Algorithm
assignment	I-Algorithm
problem	I-Algorithm
(	O
LBAP	O
)	O
is	O
similar	O
to	O
the	O
linear	B-Algorithm
assignment	I-Algorithm
problem	I-Algorithm
.	O
</s>
<s>
Given	O
two	O
sets	O
,	O
A	O
and	O
T	O
,	O
together	O
with	O
a	O
weight	B-Algorithm
function	I-Algorithm
C	O
:	O
A	O
T	O
R	O
.	O
Find	O
a	O
bijection	B-Algorithm
f	O
:	O
A	O
T	O
such	O
that	O
the	O
cost	O
function	O
:	O
</s>
<s>
Usually	O
the	O
weight	B-Algorithm
function	I-Algorithm
is	O
viewed	O
as	O
a	O
square	O
real-valued	O
matrix	B-Architecture
C	O
,	O
so	O
that	O
the	O
cost	O
function	O
is	O
written	O
down	O
as	O
:	O
</s>
