2025-02-23T21:38:55-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-84951%22&qt=morelikethis&rows=5
2025-02-23T21:38:55-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-84951%22&qt=morelikethis&rows=5
2025-02-23T21:38:55-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-23T21:38:55-05:00 DEBUG: Deserialized SOLR response
Лагранжевая оценка для максимального разреза графа с заданными количествами вершин в обоих подмножествах разбиения
The problem of finding upper Lagrange bound Ψ* for quadratic formulation of maximum cut problem with given numbers of vertices in both partition subsets is considered. It's shown that finding Ψ* reduce to solving unconstraint problem of minimizing convex function.
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
Інститут кібернетики ім. В.М. Глушкова НАН України
2006
|
| Series: | Теорія оптимальних рішень |
| Online Access: | http://dspace.nbuv.gov.ua/handle/123456789/84951 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
2025-02-23T21:38:55-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&rows=40&rows=5&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-84951%22&qt=morelikethis
2025-02-23T21:38:55-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%22irk-123456789-84951%22&qt=morelikethis
2025-02-23T21:38:55-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-23T21:38:55-05:00 DEBUG: Deserialized SOLR response