Computing closely matching upper and lower bounds on textile nesting problems (Q1296780)
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: Computing closely matching upper and lower bounds on textile nesting problems |
scientific article; zbMATH DE number 1320319
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing closely matching upper and lower bounds on textile nesting problems |
scientific article; zbMATH DE number 1320319 |
Statements
Computing closely matching upper and lower bounds on textile nesting problems (English)
0 references
3 August 1999
0 references
packing
0 references
nesting
0 references
industrial cutting problem
0 references
textile manufacturing
0 references
lower bounds
0 references
upper bounds
0 references
simulated annealing
0 references
branch-and-bound methods
0 references
0 references
0.7989429831504822
0 references
0.7692354917526245
0 references
