RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Series 2, 2000, Volume 7, Number 1  


The plant location problem on a two-tree with bounded communication capacities
I. P. Voznyuk
3
Polynomial solvability of scheduling problems with storable resources and directive deadlines
E. Kh. Gimadi, V. V. Zalyubovskii, S. V. Sevast'yanov
9
Two-level standardization problems under conditions when the optimal consumer choice is not unique
L. Y. Gorbachevskaya
35
A genetic algorithm for the covering problem
A. V. Eremeev
47
On the problem of the linear ordering of vertices of parallel-sequential graphs
G. G. Zabudskii
61
An efficient algorithm for the approximate solution of the metric traveling salesman problem
Yu. L. Kostyuk, S. A. Zhikharev
65
An efficiently solvable case of the scheduling problem with renewable resources
V. V. Servakh
75
Outerplanar graphs with the metric continuation property. I
T. I. Fedoryaeva
83
Дискретный анализ и исследование операций
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020