Network flows and non-guillotine cutting patterns (Q795062): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(84)90075-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2059699875 / rank | |||
Normal rank | |||
Revision as of 21:29, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Network flows and non-guillotine cutting patterns |
scientific article |
Statements
Network flows and non-guillotine cutting patterns (English)
0 references
1984
0 references
Up till now there has been no exact and effective algorithm for the problem of finding optimal cutting patterns of rectangles which are not restricted to those with the ''guillotine'' property. This problem can be interpreted in a resource constrained scheduling context. The contribution of this paper to this topic is a good characterization of the flow functions and graphs corresponding to cutting patterns. This characterization makes it possible to look for good cutting patterns with the help of network flows and graph theoretical techniques.
0 references
planar graphs
0 references
cutting patterns
0 references
network flows
0 references
