2025-02-23T12:06:57-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-84995%22&qt=morelikethis&rows=5
2025-02-23T12:06:57-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-84995%22&qt=morelikethis&rows=5
2025-02-23T12:06:57-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-23T12:06:57-05:00 DEBUG: Deserialized SOLR response
Оптимальные решения многокритериальных комбинаторных задач на размещениях
The problem of multicriterion combinatorial optimization on placing is examined. It is grounded, that the effective decisions of task are in the tops of polyhedron of placing. The algorithm of finding of Pareto-optimum estimations is represented for combinatorial multicriterion problems.
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
Інститут кібернетики ім. В.М. Глушкова НАН України
2007
|
| Series: | Теорія оптимальних рішень |
| Online Access: | http://dspace.nbuv.gov.ua/handle/123456789/84995 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The problem of multicriterion combinatorial optimization on placing is examined. It is grounded, that the effective decisions of task are in the tops of polyhedron of placing. The algorithm of finding of Pareto-optimum estimations is represented for combinatorial multicriterion problems. |
|---|