1-center problem
The 1-center problem, also known as minimax problem or minmax location problem, is a classical combinatorial optimization problem in operations research of facilities location type. In its most general case the problem is stated as follows: given a set of n demand points, a space of feasible locations of a facility and a function to calculate the transportation cost between a facility and any demand point, find a location of the facility which minimizes the maximum facility-demand point transportation cost.
primaryTopic
1-center problem
The 1-center problem, also known as minimax problem or minmax location problem, is a classical combinatorial optimization problem in operations research of facilities location type. In its most general case the problem is stated as follows: given a set of n demand points, a space of feasible locations of a facility and a function to calculate the transportation cost between a facility and any demand point, find a location of the facility which minimizes the maximum facility-demand point transportation cost.
has abstract
The 1-center problem, also kno ...... lled the minimax path problem.
@en
Задача о 1-центре или минимакс ...... нкции, вычисляющей расстояние.
@ru
Link from a Wikipage to an external page
Wikipage page ID
15,619,327
page length (characters) of wiki page
Wikipage revision ID
1,024,955,772
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
type
comment
The 1-center problem, also kno ...... and point transportation cost.
@en
Задача о 1-центре или минимакс ...... нкции, вычисляющей расстояние.
@ru
label
1-center problem
@en
Задача о 1-центре
@ru