An asymptotically exact algorithm for the high-multiplicity bin packing problem (Q2570998): 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.1007/s10107-004-0567-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2057976086 / rank | |||
Normal rank | |||
Revision as of 02:13, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An asymptotically exact algorithm for the high-multiplicity bin packing problem |
scientific article |
Statements
An asymptotically exact algorithm for the high-multiplicity bin packing problem (English)
0 references
31 October 2005
0 references
bin packing problem
0 references
algorithm
0 references
optimal solution
0 references
complexity
0 references
