Now showing items 1-3 of 3

  • Hybrid algorithms for the variable sized bin packing problem 

    Blum, Christian; Hemmelmayr, Vera C.; Hernández Pibernat, Hugo; Schmid, Verena (2010-10)
    Article
    Restricted access - publisher's policy
    This paper deals with the so-called variable sized bin packing problem, which is a generalization of the one-dimensional bin packing problem in which a set of items with given weights have to be packed into a minimum-cost ...
  • Solving the two-dimensional bin packing problem with a probabilistic multi-start heuristic 

    Baumgartner, Lukas; Schmid, Verena; Blum, Christian (2011)
    Article
    Restricted access - publisher's policy
    The two-dimensional bin packing problem (2BP) consists in packing a set of rectangular items into rectangular, equally-sized bins. The problem is NP-hard and has a multitude of real world applications. We consider the case ...
  • Variable neighbourhood search for the variable sized bin packing problem 

    Hemmelmayr, Vera C.; Schmid, Verena; Blum, Christian (2012-05)
    Article
    Restricted access - publisher's policy
    The variable sized bin packing problem is a generalisation of the one-dimensional bin packing problem. Given is a set of weighted items, which must be packed into a minimum-cost set of bins of variable sizes and costs. ...