Computing closely matching upper and lower bounds on textile nesting problems (Q1296780): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0377-2217(97)00049-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2084566137 / rank | |||
Normal rank | |||
Latest revision as of 10:52, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing closely matching upper and lower bounds on textile nesting problems |
scientific article |
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
