Solving sequential interval cutting problems via dynamic programming (Q1197666): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(92)90344-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1989133164 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3241581 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A typology of cutting and packing problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5569992 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3805803 / rank | |||
Normal rank | |||
Latest revision as of 15:29, 16 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving sequential interval cutting problems via dynamic programming |
scientific article |
Statements
Solving sequential interval cutting problems via dynamic programming (English)
0 references
16 January 1993
0 references
cutting stock
0 references
sequential one-dimensional cutting
0 references
