Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems (Q2569035)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems |
scientific article; zbMATH DE number 2214900
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems |
scientific article; zbMATH DE number 2214900 |
Statements
Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems (English)
0 references
17 October 2005
0 references
genetic algorithms
0 references
branch and bound
0 references
cutting
0 references
packing
0 references
0 references
0 references
0.8146149516105652
0 references
0.7955030798912048
0 references
0.7879782319068909
0 references
0.7792508602142334
0 references
