The Proof of the Algorithms Convergence for Combinatorial Optimization with the Using Subclasses of the Solved Problems
Saved in:
| Date: | 2016 |
|---|---|
| Main Author: | N. K. Tymofiieva |
| Format: | Article |
| Language: | English |
| Published: |
2016
|
| Series: | Control Systems and Computers |
| Online Access: | http://jnas.nbuv.gov.ua/article/UJRN-0000524375 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Library portal of National Academy of Sciences of Ukraine | LibNAS |
Institution
Library portal of National Academy of Sciences of Ukraine | LibNASSimilar Items
-
Criteria of Similarity of Dynamic Problems of Combinatorial Optimization
by: N. K. Tymofiieva
Published: (2019) -
On Some Approaches to Estimating the Optimal Solution of Combinatorial Optimization Problems
by: N. K. Tymofiieva
Published: (2019) -
Finding Subclasses of Solvable Problems in Combinary Optimization and Artificial Intelligence by Structure of Input Information
by: V. I. Hrytsenko, et al.
Published: (2022) -
Solving Combinatorial Optimization Problems on Quantum Computers
by: Yu. Korolov, et al.
Published: (2020) -
Optimal Paralleling for Solving Combinatorial Modelling Problems using Graphics Processing Units
by: S. Yefimenko
Published: (2012)