2025-02-23T20:22:41-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-84960%22&qt=morelikethis&rows=5
2025-02-23T20:22:41-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-84960%22&qt=morelikethis&rows=5
2025-02-23T20:22:41-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-23T20:22:41-05:00 DEBUG: Deserialized SOLR response
Алгоритм допусков для решения задач комбинаторной оптимизации (ЗКО)

Алгоритм допусков для решения задач комбинаторной оптимизации (ЗКО)

The paper considers using tolerance theory for solving combinatorial optimization problems. As a result initial problem solving converts to solving a set of special problem with special data structure. The tolerance theory and data correction are used in new algorithm for solving an assignment probl...

Full description

Saved in:
Bibliographic Details
Main Authors: Бойко, В.В., Гольденгорин, Б.И., Кузьменко, В.Н.
Format: Article
Language:Russian
Published: Інститут кібернетики ім. В.М. Глушкова НАН України 2006
Series:Теорія оптимальних рішень
Online Access:http://dspace.nbuv.gov.ua/handle/123456789/84960
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The paper considers using tolerance theory for solving combinatorial optimization problems. As a result initial problem solving converts to solving a set of special problem with special data structure. The tolerance theory and data correction are used in new algorithm for solving an assignment problem. The results of computational experiments are given in comparison with results of the best methods.

Similar Items