Some combinatorial optimization problems can be efficiently solved with dynamic programming. Such a dynamic programming approach provides an extended formulation of the given problem. From the extended formulation we want to derive facets of the associated polyhedron in original space.