Numerical Methods for Solving the Pursuit Optimization Problems
Problems in programming 2013; 4: 74-85
Saved in:
| Date: | 2025 |
|---|---|
| Main Authors: | Pashko, C.V., Yalovets, A.L. |
| Format: | Article |
| Language: | Russian |
| Published: |
PROBLEMS IN PROGRAMMING
2025
|
| Subjects: | |
| Online Access: | https://pp.isofts.kiev.ua/index.php/ojs1/article/view/743 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Problems in programming |
| Download file: | |
Institution
Problems in programmingSimilar Items
-
Maximal time of pursuit for the strategy of parallel approach
by: Pashko, S.V., et al.
Published: (2019) -
NP-hardness of collective pursuiting optimization problems
by: Pashko, S.V.
Published: (2025) -
Modification of the family three-point iterative method for refinement of simple roots of monotonic nonsmooth function
by: Шелудько, Г. А., et al.
Published: (2015) -
Modification of the family three-point iterative method for refinement of simple roots of monotonic nonsmooth function
by: Шелудько, Г. А., et al.
Published: (2015) -
To the problem of pursuit on the plane
by: Yalovets, A.L.
Published: (2025)