Network flows and non-guillotine cutting patterns |
| |
Authors: | Milós Biró Endre Boros |
| |
Affiliation: | Computer and Automation Institute, Hungarian Academy of Sciences, Budapest, P.O. Box 63, H - 1502, Hungary |
| |
Abstract: | 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. |
| |
Keywords: | Location convex hull property mixed norms |
本文献已被 ScienceDirect 等数据库收录! |