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 this page instead for the normal view: Solving two-dimensional bin packing problems with two-stage guillotine cutting by combined local search heuristics |
scientific article; zbMATH DE number 6204617
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
