<s>
The	O
1-center	B-Algorithm
problem	I-Algorithm
,	O
also	O
known	O
as	O
minimax	O
problem	O
or	O
minmax	O
location	O
problem	O
,	O
is	O
a	O
classical	O
combinatorial	O
optimization	O
problem	O
in	O
operations	O
research	O
of	O
facilities	O
location	O
type	O
.	O
</s>
<s>
A	O
simple	O
special	O
case	O
is	O
when	O
the	O
feasible	O
locations	O
and	O
demand	O
points	O
are	O
in	O
the	O
plane	O
with	O
Euclidean	O
distance	O
as	O
transportation	O
cost	O
(	O
planar	O
minmax	O
Euclidean	O
facility	O
location	O
problem	O
,	O
Euclidean	O
1-center	B-Algorithm
problem	I-Algorithm
in	O
the	O
plane	O
,	O
etc	O
.	O
)	O
.	O
</s>
<s>
Its	O
generalization	O
to	O
n-dimensional	O
Euclidean	O
spaces	O
is	O
known	O
as	O
the	O
smallest	B-Algorithm
enclosing	I-Algorithm
ball	I-Algorithm
problem	O
.	O
</s>
<s>
The	O
1-center	B-Algorithm
problem	I-Algorithm
can	O
be	O
restated	O
as	O
finding	O
a	O
star	O
in	O
a	O
weighted	O
complete	O
graph	O
that	O
minimizes	O
the	O
maximum	O
weight	O
of	O
the	O
selected	O
edges	O
.	O
</s>
