The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP (Q3842995): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A typology of cutting and packing problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An instance of the cutting stock problem for which the rounding property does not hold / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solving binary cutting stock problems by column generation and branch- and-bound / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Heuristics for the integer one-dimensional cutting stock problem: A computational study / rank | |||
Normal rank | |||
Latest revision as of 15:55, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP |
scientific article |
Statements
The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP (English)
0 references
20 August 1998
0 references
bin-packing problem
0 references
heuristic solution
0 references
FFD packing
0 references
