Browse by

  • Collections
  • Sources

Geodesic


    Browse by

    • Collections
    • Sources
Diskretnyj analiz i issledovanie operacij
Volume 26 (2019)
no. 2
Previous Next

Volume 26 (2019) no. 2

Table of contents


A cut generation algorithm of finding an optimal solution in a market competition
V. L. Beresnev; A. A. Melnikov
p. 5-29

A polynomial $3/5$-approximate algorithm for the asymmetric maximization version of $3$-PSP
A. N. Glebov; S. G. Toktokhoeva
p. 30-59

A local search algorithm for the single machine scheduling problem with setups and a storage
P. A. Kononova; Yu. A. Kochetov
p. 60-78

Estimating the stability radius of an optimal solution to the simple assembly line balancing problem
K. G. Kuzmin; V. R. Haritonova
p. 79-97

On a construction of easily decodable sub-de Bruijn arrays
D. A. Makarov; A. D. Yashunsky
p. 98-114

Experimental methods for constructing MDS matrices of a special form
M. I. Rozhkov; S. S. Malakhov
p. 115-128

Asymptotics for the logarithm of the number of $(k,l)$-solution-free collections in an interval of naturals
A. A. Sapozhenko; V. G. Sargsyan
p. 129-144
  • About
  • Contact
  • Legal notice
  • Privacy policy