On a problem of choosing elements in a family of sequences

Alexander Kel'manov, Ludmila Mikhailova, Semyon Romanchenko

Research output: Contribution to journalConference articlepeer-review

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.

Original languageEnglish
Pages (from-to)181-188
Number of pages8
JournalCEUR Workshop Proceedings
Volume2098
Publication statusPublished - 1 Jan 2018
Event2018 School-Seminar on Optimization Problems and their Applications, OPTA-SCL 2018 - Omsk, Russian Federation
Duration: 8 Jul 201814 Jul 2018

Keywords

  • Exact polynomial-time algorithm
  • Finite numerical sequences
  • Optimal summing
  • Permutations

Fingerprint Dive into the research topics of 'On a problem of choosing elements in a family of sequences'. Together they form a unique fingerprint.

Cite this