Orientational variable-length strip covering problem: a branch-and-price-based algorithm (Q2028818)
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: Orientational variable-length strip covering problem: a branch-and-price-based algorithm |
scientific article; zbMATH DE number 7354052
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Orientational variable-length strip covering problem: a branch-and-price-based algorithm |
scientific article; zbMATH DE number 7354052 |
Statements
Orientational variable-length strip covering problem: a branch-and-price-based algorithm (English)
0 references
3 June 2021
0 references
covering problem
0 references
strip covering problem
0 references
EOS scheduling
0 references
dominance rule
0 references
nested grids
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.88104224
0 references
0.8598713
0 references
0.8582156
0 references
0.8376576
0 references
0 references
0.8271827
0 references
0.8249321
0 references
