Large-Scale Problems with Quasi-Block Matrices-Reference-Cited by-同舟云学术

Large-Scale Problems with Quasi-Block Matrices

Published:2019-07 Issue:4 Volume:58 Page:571-578
ISSN:1064-2307
Container-title:Journal of Computer and Systems Sciences International
language:en
Short-container-title:J. Comput. Syst. Sci. Int.

Author:

Lemtyuzhnikova D. V.,Leonov V. Yu.

Publisher

Pleiades Publishing Ltd

Subject

Applied Mathematics,Computer Networks and Communications,Computer Vision and Pattern Recognition,Information Systems,Theoretical Computer Science,Control and Systems Engineering,Software

Link

http://link.springer.com/content/pdf/10.1134/S1064230719040099.pdf

Reference16 articles.

1. V. I. Tsurkov, Decomposition in Large-Scale Problems (Nauka, Moscow, 1981) [in Russian].

2. I. L. Averbakh and V. I. Tsurkov, Optimization in Large Problems with Integer Variables (Nauka, Fizmatlit, Moscow, 1995) [in Russian].

3. V. I. Tsurkov, “The principle of decomposition for block-separable systems,” Dokl. Akad. Nauk SSSR 246, 27–31 (1979).

4. O. A. Shcherbina, D. V. Lemtyuzhnikova, and V. I. Tsurkov, Multidimensional Problems with Quasi-Block Matrices (Fizmatlit, Moscow, 2018) [in Russian].

5. Yu. Yu. Finkel’shtein, Approximate Methods and Applied Problems of Discrete Programming (Nauka, Moscow, 1976) [in Russian].

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Metric Approach for Finding Approximate Solutions of Scheduling Problems;Computational Mathematics and Mathematical Physics;2021-07

2. A metric approach for scheduling problems with minimizing the maximum penalty;Applied Mathematical Modelling;2021-01

3. Polynomially Solvable Subcases for the Approximate Solution of Multi-machine Scheduling Problems;Communications in Computer and Information Science;2020