A Set-Covering-Based Heuristic Approach for Bin-Packing Problems (Q2892273): Difference between revisions
From MaRDI portal
Changed an Item |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1287/ijoc.1040.0089 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2139771428 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/IJOC.1040.0089 / rank | |||
Normal rank | |||
Latest revision as of 03:33, 20 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Set-Covering-Based Heuristic Approach for Bin-Packing Problems |
scientific article |
Statements
A Set-Covering-Based Heuristic Approach for Bin-Packing Problems (English)
0 references
18 June 2012
0 references
two-constraint bin-packing
0 references
two-dimensional bin-packing
0 references
set-covering heuristics
0 references
