Efficient algorithms for the offline variable sized bin-packing problem (Q2434654): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Bison / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10898-012-9989-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1975570210 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:43, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for the offline variable sized bin-packing problem |
scientific article |
Statements
Efficient algorithms for the offline variable sized bin-packing problem (English)
0 references
6 February 2014
0 references
bin-packing problem
0 references
heuristics
0 references
monotonicity constraint
0 references
