Standard

On a problem of choosing elements in a family of sequences. / Kel'manov, Alexander; Mikhailova, Ludmila; Romanchenko, Semyon.

In: CEUR Workshop Proceedings, Vol. 2098, 01.01.2018, p. 181-188.

Research output: Contribution to journal › Conference article › peer-review

Harvard

Kel'manov, A, Mikhailova, L & Romanchenko, S 2018, 'On a problem of choosing elements in a family of sequences', CEUR Workshop Proceedings, vol. 2098, pp. 181-188.

APA

Kel'manov, A., Mikhailova, L., & Romanchenko, S. (2018). On a problem of choosing elements in a family of sequences. CEUR Workshop Proceedings, 2098, 181-188.

Vancouver

Kel'manov A, Mikhailova L, Romanchenko S. On a problem of choosing elements in a family of sequences. CEUR Workshop Proceedings. 2018 Jan 1;2098:181-188.

Author

Kel'manov, Alexander ; Mikhailova, Ludmila ; Romanchenko, Semyon. / On a problem of choosing elements in a family of sequences. In: CEUR Workshop Proceedings. 2018 ; Vol. 2098. pp. 181-188.

BibTeX

@article{b4a9932303c34512b6aadb2abd812799,
title = "On a problem of choosing elements in a family of sequences",
abstract = "In the problem considered, it is required to minimize the sum of elements chosen in a family of finite numerical sequences with some constraints on the choice of elements. Namely, given a family of L nonnegative N-element sequences and a positive integer J, we need to minimize the sum of J intra-sums each of which includes only one element in every input sequence with all possible L-permutations of these sequences and under some constraints on the choice of elements to be included in the general double sum. The problem is related, for example, to the distant noise-prove monitoring of several moving objects with possible arbitrary displacements (permutations) of these objects. For this problem we present an exact polynomial-time algorithm with O(N5) running time.",
keywords = "Exact polynomial-time algorithm, Finite numerical sequences, Optimal summing, Permutations",
author = "Alexander Kel'manov and Ludmila Mikhailova and Semyon Romanchenko",
note = "Publisher Copyright: Copyright {\textcopyright} by the paper's authors.; 2018 School-Seminar on Optimization Problems and their Applications, OPTA-SCL 2018 ; Conference date: 08-07-2018 Through 14-07-2018",
year = "2018",
month = jan,
day = "1",
language = "English",
volume = "2098",
pages = "181--188",
journal = "CEUR Workshop Proceedings",
issn = "1613-0073",
publisher = "CEUR-WS",

}

RIS

TY - JOUR

T1 - On a problem of choosing elements in a family of sequences

AU - Kel'manov, Alexander

AU - Mikhailova, Ludmila

AU - Romanchenko, Semyon

N1 - Publisher Copyright: Copyright © by the paper's authors.

PY - 2018/1/1

Y1 - 2018/1/1

N2 - In the problem considered, it is required to minimize the sum of elements chosen in a family of finite numerical sequences with some constraints on the choice of elements. Namely, given a family of L nonnegative N-element sequences and a positive integer J, we need to minimize the sum of J intra-sums each of which includes only one element in every input sequence with all possible L-permutations of these sequences and under some constraints on the choice of elements to be included in the general double sum. The problem is related, for example, to the distant noise-prove monitoring of several moving objects with possible arbitrary displacements (permutations) of these objects. For this problem we present an exact polynomial-time algorithm with O(N5) running time.

AB - In the problem considered, it is required to minimize the sum of elements chosen in a family of finite numerical sequences with some constraints on the choice of elements. Namely, given a family of L nonnegative N-element sequences and a positive integer J, we need to minimize the sum of J intra-sums each of which includes only one element in every input sequence with all possible L-permutations of these sequences and under some constraints on the choice of elements to be included in the general double sum. The problem is related, for example, to the distant noise-prove monitoring of several moving objects with possible arbitrary displacements (permutations) of these objects. For this problem we present an exact polynomial-time algorithm with O(N5) running time.

KW - Exact polynomial-time algorithm

KW - Finite numerical sequences

KW - Optimal summing

KW - Permutations

UR - http://www.scopus.com/inward/record.url?scp=85047997803&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:85047997803

VL - 2098

SP - 181

EP - 188

JO - CEUR Workshop Proceedings

JF - CEUR Workshop Proceedings

SN - 1613-0073

T2 - 2018 School-Seminar on Optimization Problems and their Applications, OPTA-SCL 2018

Y2 - 8 July 2018 through 14 July 2018

ER -

ID: 13754059