SOLVABILITY EXPLORATION OF SEGMENTATION PROBLEM WITH LINEAR CONVOLUTION ALGORITHMS

Perepelitsa, V. A.; Tebueva, F.B.; Shenkao, Timour

The paper is dedicated to decidability exploration of market segmentation problem with the help of linear convolution algorithms. Mathematical formulation of this problem represents interval task of bipartite graph cover by stars. Vertices of the first partition correspond to types of commodities, vertices of the second – to customers groups. Appropriate method is offered for interval problem reduction to two-criterion task that has one implemented linear convolution algorithm. Unsolvability with the help of linear convolution algorithm of multicriterion, and consequently interval, market segmentation problem is proved.

Zitieren

Zitierform:

Perepelitsa, V. A. / Tebueva, F.B. / Shenkao, Timour: SOLVABILITY EXPLORATION OF SEGMENTATION PROBLEM WITH LINEAR CONVOLUTION ALGORITHMS. 2006.

Zugriffsstatistik

Gesamt:
Volltextzugriffe:
Metadatenansicht:
12 Monate:
Volltextzugriffe:
Metadatenansicht:

Grafik öffnen

Rechte

Nutzung und Vervielfältigung:

Export