New submission at 2017-05-03 12:44:53.331480

company: Dipartimento di Informatica, Università di Pisa

creator: Federico Giuseppe Pisanu

description: "Given a set P of polygons, not necessarily convex, and a rectangle,\

  \ we want to find the subset S of P with largest possible total area and a position\

  \ every p in S so that there are no overlaps and they are all included in the rectangle.\

  \ We allow a small set of rotations (0, 90, 180, 270 degrees) for every polygon.\

  \ The problem is simplified w.r.t. the real application because the polygons do\

  \ not have (fully encircled) \"holes\", which are supposedly filled-in separately,\

  \ although they can have \"bays\".\r\n\r\nModels are saved as .lp. Instance LpPackingModel<X>_Dim<Y>\

  \ means that we are trying to pack <Y> polygons taken from set <X>; there are currently\

  \ 5 different sets, and <Y> is 7, 10 or 15.\r\n"

email: frangio@di.unipi.it

license: cc-license

misc: ''

name: Antonio Frangioni

other-license: ''

owner: InterSystems S.r.L.