An on-line bin-batching problem. (Q5929317): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: On a dual version of the one-dimensional bin packing problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2707233 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Online algorithms for a dual version of bin packing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Online algorithms. The state of the art / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal on-line algorithms for variable-sized bin covering / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0166-218x(00)00243-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2010014647 / rank | |||
Normal rank | |||
Latest revision as of 10:22, 30 July 2024
scientific article; zbMATH DE number 1584602
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An on-line bin-batching problem. |
scientific article; zbMATH DE number 1584602 |
Statements
An on-line bin-batching problem. (English)
0 references
18 February 2004
0 references
bin covering
0 references
on-line algorithm
0 references
