Cублінійний оптимальний наближений алгоритм реоптимізації для задачі про мінімальне вершинне покриття графа
With the approximate solution of discrete optimization problems such idea arises: is it possible, taking into account the information about the optimal solution of an instance (or close to it), use this information to find the optimal (or close to it) solution of instance problem obtained as a resul...
Saved in:
| Date: | 2013 |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | Ukrainian |
| Published: |
The National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute"
2013
|
| Online Access: | http://journal.iasa.kpi.ua/article/view/57494 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | System research and information technologies |