 Note that this is no longer considered as a polynomial running time since, in the given instance, the width of the strip needs an encoding size of formula_274.The pseudo-polynomial time algorithms that have been developed mostly use the same approach.It is shown that each optimal solution can be simplified and transformed into one that has one of a constant number of structures.