Solving two-dimensional bin packing problems with two-stage guillotine cutting by combined local search heuristics (Q2846933)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6204617
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving two-dimensional bin packing problems with two-stage guillotine cutting by combined local search heuristics |
scientific article; zbMATH DE number 6204617 |
Statements
4 September 2013
0 references
two-dimensional guillotine bin packing problems
0 references
local search heuristics
0 references
variable neighborhood descent
0 references
random neighbor selection
0 references
optimizaton
0 references
Solving two-dimensional bin packing problems with two-stage guillotine cutting by combined local search heuristics (English)
0 references
0.8911222219467163
0 references
0.865359902381897
0 references
0.8531237244606018
0 references
0.8482925295829773
0 references
0.8471916913986206
0 references
