Packing items into several bins facilitates approximating the separable assignment problem (Q2345851): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q57851339, #quickstatements; #temporary_batch_1706897434465 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57851339 / rank | |||
Normal rank | |||
Revision as of 21:56, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Packing items into several bins facilitates approximating the separable assignment problem |
scientific article |
Statements
Packing items into several bins facilitates approximating the separable assignment problem (English)
0 references
21 May 2015
0 references
separable assignment problem
0 references
approximation algorithms
0 references
randomized rounding
0 references
