Network flows and non-guillotine cutting patterns

Milós Biró, Endre Boros

Research output: Contribution to journalArticle

15 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)215-221
Number of pages7
JournalEuropean Journal of Operational Research
Issue number2
StatePublished - May 1984

All Science Journal Classification (ASJC) codes

  • Information Systems and Management
  • Computer Science(all)
  • Modeling and Simulation
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'Network flows and non-guillotine cutting patterns'. Together they form a unique fingerprint.

  • Cite this