A new branch-and-cut algorithm for the orthogonal strip packing problem

Authors

  • Marat Mesyagutov
  • Guntram Scheithauer
  • Gleb Belov

Keywords:

linear programming; branch-and-cut; facet-defining inequalities

Abstract

We consider the 2D strip packing problem (SPP-2). Given a set of rectangular items, SPP-2 is to find a packing of all items occupying the minimal height of the given semi-infinite strip. SPP-2 is considered without items rotation.

Downloads

Published

2018-17-10

Issue

Vol. 17 No. 6 (59) (2013): Вестник УГАТУ

Section

******************************