JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website
Salii, Yaroslav Vital'evich
Statistics Math-Net.Ru
Total publications: 2
Scientific articles: 1
Presentations: 10
Number of views: This page: 218 Abstract pages: 620 Full texts: 267 References: 87
Candidate of physico-mathematical sciences (2019)
https://www.mathnet.ru/eng/person95239
List of publications on Google Scholar
List of publications on ZentralBlatt
Publications in Math-Net.Ru Citations
2014
1.
Ya. V. Salii, “On the effect of precedence constraints on computational complexity of dynamic programming method for routing problems”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki , 2014, no. 1, 76–86
3
2015
2.
A. G. Chentsov, Ya. V. Salii, “A model of “nonadditive” routing problem where the costs depend on the set of pending tasks”, Vestnik YuUrGU. Ser. Mat. Model. Progr. , 8 :1 (2015), 24–45
4
Presentations in Math-Net.Ru
1.
State cost estimation and early stopping of DP procedure for TSPs with profits Seminar of Control System Department December 15, 2016
2.
On dynamic programming for Precedence-Constrained TSPs with Profits Seminar of Control System Department September 29, 2016
3.
Обобщения задачи коммивояжера с условиями предшествования и
смежные вопросы Seminar for Optimization Laboratory April 22, 2016
4.
Camera Trap TSPs Seminar of Control System Department January 21, 2016
5.
Branch-and-bound method in Dynamic Programming Seminar of Control System Department May 28, 2015 12:00
6.
On a "double-edged" parallel implementation of a sort of dynamic programming for precedence constrained routing problems Seminar of Control System Department April 23, 2015
7.
On variations of dynamic programming for precedence constrained
routing problems and "technical" issues of their implementation Seminar of Control System Department December 25, 2014
8.
A model of «nonadditive» routing problem where the costs depend on the set of pending tasks Seminar of Control System Department December 18, 2014
9.
Dynamic Programming Solutions for Precedence Constrained Routing and Scheduling Problems: A Survey Seminar of Control System Department October 9, 2014
10.
Counting the complexity of dynamic programming for sequencing problems with precedence constraints: polynomially solvable cases and the general case Seminar of Control System Department May 22, 2014
Organisations
Contact us: