2025-02-23T10:45:38-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22journaliasakpiua-article-52086%22&qt=morelikethis&rows=5
2025-02-23T10:45:38-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22journaliasakpiua-article-52086%22&qt=morelikethis&rows=5
2025-02-23T10:45:38-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-23T10:45:38-05:00 DEBUG: Deserialized SOLR response
Метод обчислення дельта-складових зі складністю O(1) в квадратичній задачі про призначення

Метод обчислення дельта-складових зі складністю O(1) в квадратичній задачі про призначення

The quadratic assignment problem is rightfully considered to be one of the most challenging problems of combinatorial optimization. Since this problem is NP-hard, the use of heuristic algorithms is the only way to find in a reasonable time a solution that is close to optimal. One of the most effecti...

Full description

Saved in:
Bibliographic Details
Main Authors: Podolsky, S. V., Zorin, Yu. M.
Format: Article
Language:English
Published: The National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute" 2015
Online Access:http://journal.iasa.kpi.ua/article/view/52086
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items

2025-02-23T10:45:38-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&rows=40&rows=5&wt=json&json.nl=arrarr&q=id%3A%22journaliasakpiua-article-52086%22&qt=morelikethis
2025-02-23T10:45:38-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&rows=40&rows=5&wt=json&json.nl=arrarr&q=id%3A%22journaliasakpiua-article-52086%22&qt=morelikethis
2025-02-23T10:45:38-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-23T10:45:38-05:00 DEBUG: Deserialized SOLR response

Similar Items