Linear convolution of criteria in the vector p-center problem
Закрыть
Conţinutul numărului revistei
Articolul precedent
Articolul urmator
822 1
Ultima descărcare din IBN:
2018-06-01 06:42
SM ISO690:2012
EMELICHEV, Vladimir, GUREVSKY, Evgeny. Linear convolution of criteria in the vector p-center problem. In: Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, 2007, nr. 1(53), pp. 73-82. ISSN 1024-7696.
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica
Numărul 1(53) / 2007 / ISSN 1024-7696 /ISSNe 2587-4322

Linear convolution of criteria in the vector p-center problem

Pag. 73-82

Emelichev Vladimir, Gurevsky Evgeny
 
Institute of Mathematics and Computer Science ASM
 
 
Disponibil în IBN: 16 decembrie 2013


Rezumat

We investigate a linear convolution of criteria and possibility of its application for finding Pareto set in the vector variant of the well-known combinatorial p-center problem. The polynomial algorithm which transforms any vector p-center problem to a solvable problem with the same Pareto set is proposed. An example which illustrates the work of algorithm is performed.

Cuvinte-cheie
p-center problem, algorithm of linear convolution (ALC), solvability by ALC,

Pareto set