Packing

Abstract

This chapter focuses on the famous cutting stock/bin packing problem which was the first problem to be modeled by column generation. The compact equivalent counterpart of this problem has a very interesting structure of a particular flow problem. Two other packing problems for which we may show compact extended formulations are the robust knapsack problem and the cycle packing problem. For the former problem we show, by using LP techniques, that of two different formulations appeared in the literature one is indeed the compact extended formulation of the other.