  Decision diagrams are an increasingly important tool in cutting-edge solvers
for discrete optimization. However, the field of decision diagrams is
relatively new, and is still incorporating the library of techniques that
conventional solvers have had decades to build. We drew inspiration from the
warm-start technique used in conventional solvers to address one of the major
challenges faced by decision diagram based methods. Decision diagrams become
more useful the wider they are allowed to be, but also become more costly to
generate, especially with large numbers of variables. We present a method of
peeling off a sub-graph of previously constructed diagrams and using it as the
initial diagram for subsequent iterations that we call peel-and-bound. We test
the method on the sequence ordering problem, and our results indicate that our
peel-and-bound scheme generates stronger bounds than a branch-and-bound scheme
using the same propagators, and at significantly less computational cost.
