Learn More
This paper is concerned with the problem of unconstrained two-dimensional cutting of small rectangular pieces, each of which has its own pro!t and size, from a large rectangular plate so as to maximize the pro!t-sum of the pieces produced. Hi! and Zissimopoulos’s recursive algorithm using G and Kang’s upper bound is presently the most e5cient exact(More)
  • 1