Packing items into several bins facilitates approximating the separable assignment problem (Q2345851): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2015.02.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1971228003 / rank | |||
Normal rank | |||
Revision as of 23:06, 19 March 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
